The week's pick
Reseach Article
Scheduling Simulations: An Experimental Approach to Time-Sharing Multiprocessor Scheduling Schemes
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 63 - Number 11 |
| Year of Publication: 2013 |
| Authors: Swinky Arora, Ankit Arora, Gursharanjit Singh Cheema |
10.5120/10512-5476
|
Swinky Arora, Ankit Arora, Gursharanjit Singh Cheema . Scheduling Simulations: An Experimental Approach to Time-Sharing Multiprocessor Scheduling Schemes. International Journal of Computer Applications. 63, 11 ( February 2013), 29-35. DOI=10.5120/10512-5476
Abstract
Real time systems that are logically programmed for scientific applications involve frequent job arrivals, thus requires a parallel architecture, so that maximum applications can be executed simultaneously resulting in less waiting time and maximum resource utilization. This must be achieved by workload partitioning & characterization, directs towards the development of Multiprocessor machines, a way to achieve parallel effects. Today, multiprocessor systems cover H/W replications that may replicates complete central processing units asynchronously or multiple executional units synchronously controlled by a different/common clock respectively. This research deals with the multiprocessor scheduling implemented via simulated time sharing environment containing logically programmed virtual processors and batch lists, each batch having its associated arrival time along with number of jobs where each job contains parameters such as Batch_id, Job_id and CPU Burst_time(defined as no. of cycles required) etc. The idea behind this theory is to distribute a number of simultaneously occurring jobs to virtual processor list corresponding to a scheduling algorithm. Synchronous architectures involve SIMD based model with data parallel aspects of computations, whereas Control parallel asynchronous MIMD machines are the future trends leading towards Instruction level parallel processors involving VLIW (very large instruction word) and superscalar machines.
References
- David, L, Black. 1990. Scheduling and Resource Management Techniques for multiprocessors. Carnegie Mellon University Pittsburgh.
- Eric, W. and Kenneth, C. Sevcik 1995 Multiprocessor Scheduling for High Variability Service Time Distributions. University of Toronto.
- Nan, G. and Wang, Y. 2012. Fixed-Priority Multiprocessor Scheduling Critical Instant, Response Time and Utilization Bound. IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum. Uppsala University Sweden.
- Thu, D. Nguyen, Raj, V. & John, Z. 1996 Parallel Application Characterization for Multiprocessor Scheduling Policy Design. Department of Computer Science and Engineering. University of Washington.
- Sanjoy, B. Joel, G. 2003 The Static-priority scheduling of periodic task systems upon identical multiprocessor platforms. University of North Carolina at Chapel Hill.
- Andersson, B. 2001. Static-Priority Scheduling on Multiprocessors. Real Time System Symposium, 22nd IEEE Conference publication.
- Sascha, H. Henri, C. Frederic. S. 2011 From Simulation to Experiment : A Case Study on Multiprocessor Task scheduling. IEEE Symposium on parallel and distributed computing. CNRS/LIG Laboratory, University of Hawai at manoa, Lyon-Villeurbanne, France.
- Shivuan, J. Guy, S. Damla, T. 2007 A Performance study of multiprocessor task scheduling algorithms. Springer Science+Business Media, LLC.
- Maciej, D. Scheduling Multiprocessor Tasks 1996. European Journal of Operation Research Elsevier
- Aryabrata, B. Shelby, F. 2009 An Optimal Scheme for multiprocessor task scheduling- A machine learning approach. University of Georgia USA.
- Hsiu-Jy, H. Wei-Ming, L. 2010. Task Scheduling for multiprocessor systems with autonomous performance optimizing control. Journal of information science and engineering. Department of electrical and Computer engineering. University of Texas at san Antonio.
Index Terms
Keywords