CFP last date
03 June 2024
Reseach Article

Real-Time Workload Allocation on a Uni-processor

by Abeer Hamdy, Ahmed E. Youssef, Reda Ammar
Communications on Applied Electronics
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 1
Year of Publication: 2014
Authors: Abeer Hamdy, Ahmed E. Youssef, Reda Ammar

Abeer Hamdy, Ahmed E. Youssef, Reda Ammar . Real-Time Workload Allocation on a Uni-processor. Communications on Applied Electronics. 1, 1 ( December 2014), 6-13. DOI=10.5120/59-1302

@article{ 10.5120/59-1302,
author = { Abeer Hamdy, Ahmed E. Youssef, Reda Ammar },
title = { Real-Time Workload Allocation on a Uni-processor },
journal = { Communications on Applied Electronics },
issue_date = { December 2014 },
volume = { 1 },
number = { 1 },
month = { December },
year = { 2014 },
issn = { 2394-4714 },
pages = { 6-13 },
numpages = {9},
url = { },
doi = { 10.5120/59-1302 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2023-09-04T18:37:54.163633+05:30
%A Abeer Hamdy
%A Ahmed E. Youssef
%A Reda Ammar
%T Real-Time Workload Allocation on a Uni-processor
%J Communications on Applied Electronics
%@ 2394-4714
%V 1
%N 1
%P 6-13
%D 2014
%I Foundation of Computer Science (FCS), NY, USA

The paper presents a novel allocation algorithm to allocate independent real time tasks on a processor in a way that improves the processor’s throughput (Processor’s throughput is the number of tasks the processor can accept for execution). The proposed approach allocates tasks’ workloads (task’s workload is the percentage of work required by the processor to execute the task) instead of their processing powers (Processing power assigned to a task is a percentage of the processor reserved to execute the task such that its deadline is satisfied). To achieve our objective a variable processing power is assigned to the task under consideration over its deadline to satisfy its timing requirements instead of rejecting it if a constant processing power cannot be guaranteed as in previous CPU reservation approaches. Simulation results revealed that the acceptance rate of the admitted tasks to a certain processor using the new approach is superior to that achieved using the traditional processing power reservation approach.

  1. Aydin, H., Melhem, R., Mosse, D. and Meja-Alvarez, P., 2001, Dynamic and Aggressive Scheduling techniques for power-aware real-time systems, In Proceedings of the 22nd IEEE Real-Time systems Symposium.
  2. Birkenheuer, G. and Brinkmann, A., 2011, Reservation based overbooking for HPC clusters, In Proceedings of IEEE International Conference on Cluster computing.
  3. Caniou, Y., Charrier, G., Desprez F., 2010 ,Analysis of tasks reallocation in a dedicated grid environment, In Proceedings of IEEE international conference on cluster computing.
  4. Deng, Z., Liu, J.W.-s and Sun, S., 1996, Dynamic scheduling of hard real-time applications in open system environment, Technical Report, University of Illinois, USA.
  5. Ford, B. and Susarla, S., 1996, CPU inheritance scheduling, operating systems review.
  6. Gioiosa, R., McKee, S. A., Valero, M., 2010, Designing OS for HPC Applications: Scheduling, In Proceedings of IEEE International conference on cluster computing.
  7. H. Heidari and A. Chalechale, “Scheduling in Multiprocessor System using Genetic Algorithm”, International Journal of Advanced Science and Technology, june 2012.
  8. Jones, M.B., Roşu, D., Roşu, M., 1997, CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities, In Proceedings of the 16th ACM Symposium on Operating System Principles.
Index Terms

Computer Science
Information Sciences


Workload allocation Processing power Processor utilization Scheduling real-time tasks