An Efficient Workload Allocation to Improve Scheduling Real-Time Tasks

Hamdy, Abeer; Hussein, Ahmed E.; Ammar, Reda A.

doi:10.1109/iscc.2006.34

Cited by 4 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…end for (8) if(q < p) (9) choose q tasks with earliest completion time (10) choose one with the highest priority in these q tasks, c p(ef t(i)) = priority(c ef t(i) ) (11) else (12) choose one with the highest priority in p, …”

Section: Dssa Algorithmmentioning

confidence: 99%

“…Moreover, some algorithms schedule tasks with precedence constraints [3,9]. In contrast, our algorithm like those presented in [10,11] is independent, with the interpretation that there is no precedence relationship between tasks when processing on clusters. Therefore, the partitioned tasks can be regarded as independent tasks.…”

Section: Introduction and Related Workmentioning

confidence: 99%

“…e.g., paper [3] proposed cost in heterogeneous systems. In [10], an algorithm was introduced to boost the guarantee ratio by allocating a task using its workload instead of required constant processing power, etc. Unfortunately, all these algorithms regard high guarantee ratio as their objective and neglect minimizing all tasks' completion time (makespan).…”

Section: Introduction and Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Study of Scheduling for Processing Real-Time Communication Signals on Heterogeneous Clusters

Zhu

2008

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (I-Span 2008)

View full text Add to dashboard Cite

Exploiting clusters to develop software radio systems is a much more promising research direction. When vast much feeble communication signal data collected from highspeed network enter a cluster, they will be partitioned and allocated to nodes for processing so as to realize the processing of high-gain and low-delay. This paper proposes a general real-time scheduler model for communication signals processing on clusters, a self-adaptive task partition method and a dynamic synthetical heuristic DSSA, which considers both deadline and makespan while scheduling. By tuning correlative parameters, the DSSA can achieve higher guarantee ratio. On the promise of satisfying timing constraints, the system also has higher throughput and better load balancing. We make comparisons between DSSA and DASAP, DALAP algorithms and the simulation results show that DSSA surpasses DASAP and DALAP.

show abstract