Call for Paper

CAE solicits original research papers for the July 2023 Edition. Last date of manuscript submission is June 30, 2023.

Read More

Real-Time Workload Allocation on a Uni-processor

SocButtons v1.5

Abeer Hamdy, Ahmed E. Youssef, Reda Ammar Published in Applied Electronics

CAE Book Cover Snap
Communications on Applied Electronics
Year of Publication 2014
© 2014 by CAE Journal
Series Volume 1 Number 1
Authors Ahmed E. Youssef, Reda Ammar
10.5120/59-1302
Download full text

Abeer Hamdy, Ahmed E Youssef and Reda Ammar. Real-Time Workload Allocation on a Uni-processor. Communications on Applied Electronics 1(1):6-13, 2014. Published by Foundation of Computer Science, New York, USA. BibTeX

@article{key:article,
	author = {Abeer Hamdy and Ahmed E. Youssef and Reda Ammar},
	title = {Real-Time Workload Allocation on a Uni-processor},
	journal = {Communications on Applied Electronics},
	year = {2014},
	volume = {1},
	number = {1},
	pages = {6-13},
	note = {Published by Foundation of Computer Science, New York, USA}
}

Abstract

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.

Reference

  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.
  9. Jones, M.B. 2001, Two case studies in predictable application scheduling using Rialto/NT , In Proceedings of 7th Real-Time Technology and Applications Symposium.

Keywords

Workload allocation, Processing power, Processor utilization, Scheduling real-time tasks