Priority-Based Functional Reactive Programming (P-FRP) Using Deferred Abort
Abort (DA) model, Both models support Priority-based Functional Reactive Programming
(PFRP). Higher priority tasks sometimes do not need an immediate abort to meet their …
Keep Working with Smile
Suriayati Chuprat; Shaharuddin Salleh; Steve Goddard
(Profiled Authors: Suriayati Chuprat; Shaharuddin Salleh)
Proceedings of the International Conference on Parallel Processing Workshops. 2009:6-10:[5366903].
Abstract
Current real-time application systems demand complex functionality and are increasingly coming to be implemented upon multiprocessor platforms, with complex synchronization, data-sharing and parallelism requirements. However, the formal models for representing real-time workloads have traditionally been designed in the context of uniprocessor environments; hence, they are often not able to accurately represent relevant features of multiprocessor realtime systems. Researchers have recently addressed this shortcoming by applying workload models from Divisible Load Theory (DLT) to real-time systems. The resulting theory, referred to as Real-time Divisible Load Theory (RT-DLT), holds great promise for modeling an emergent class of massively parallel real-time workloads. However, the theory needs strong formal foundations before it can be widely used for the design and analysis of real-time systems. In this paper, we briefly describe our current findings on RT-DLT and ongoing research efforts at extending this work to develop such formal foundations. © 2009 IEEE.
Real-time divisible load theory: Incorporating computation costs
Suriayati Chuprat; Sanjoy Baruah
(Profiled Author: Suriayati Chuprat)
Proceedings – 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011. 2011;1:33-37:[6029827].
Abstract
We extend the current state of the art in real-time divisible load theory (RT-DLT), by considering the problems of scheduling a real-time divisible job on computing clusters in which different processing nodes have different computing capabilities, as well as different costs associated with executing on them. We seek to minimize the cost of executing a job while also meeting its deadline. © 2011 IEEE.
Hazila Hasan; Suriayati Chuprat
(Profiled Author: Suriayati Chuprat)
2014 4th World Congress on Information and Communication Technologies, WICT 2014. 2015:146-151.
Abstract
© 2014 IEEE.Data security and privacy have become the biggest concern in cloud computing due to the fact that data can be compromised if cloud service storage is being attacked or during cloud service breakdown. Therefore, the adoption of data partitioning in multi cloud environment to address this issue has attracted academia and researchers’ interest. Hence, this paper will discuss the concept of data partitioning, the current state-of-the-art of data partitioning and secured data partitioning in multi cloud environment. We then compared the current security approaches used to secure data partitioning in multi cloud environment. Lastly, we conclude that pure data partitioning alone is insufficient to address data security and privacy problem. Therefore, we will extend this issue for our future work.
Amir Hatami Hardoroudi; Suriayati Chuprat
(Profiled Author: Suriayati Chuprat)
ARPN Journal of Engineering and Applied Sciences. 2015;10(2):499-505.
Abstract
© 2006-2015 Asian Research Publishing Network (ARPN).So many studies have been done in order to execute all the tasks in real-time scheduler systems. However, different researcher are tried to tackle overload situation in real-time systems by using swarm algorithm. These studies have been categorized based on the various parameters which are important in real-time systems. As an instance, system cost, processor waiting time, number of tasks, balance use of system and etc. By increasing number of the task in task set, process time will be increased. In this situation, processor waiting time will be high when the number of the task increased and as result system cost is raising. To solve mentioned issue the authors proposed a task scheduler which is used PSO algorithm in order to cover deficiencies of previous studies in overloaded situation. This algorithm is suggested for preemptive tasks in uniprocessor in real-time systems. The result of the research has been shown PSO perform better while other common scheduling algorithm same as EDF and ACO are being over loaded. The authors by combine PSO and Invasive Weed Optimization (IWO) suggest a new algorithm that is called HPI algorithm which can perform better than PSO and schedule more tasks in overload situation.
M | T | W | T | F | S | S |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 | 26 | 27 | 28 | 29 |
30 | 31 |