Abstract
Since the hardware price is dropping continuously, the realization of geographically distributed mini/microcomputer systems for executing decentralized software and in particular for real-time applications recently received a great deal of attention. The cheap hardware has to be supported by quite sophisticated operating systems for which the functions, the behavior, the impact to the system performance, and the programming languages constitute complex research and experimentation subjects.
Among others, the distribution of processes (PR) over the system nodes, as well as the order of their execution in each node are functions based on strategies which are going to have a large impact on the overall system performance. In order to develop accurate scheduling strategies a special queuing model for the distributed system was introduced. The model considers the hardware and software particularities of a fully distributed microcomputer system as well as the interdependency among PRs located in different nodes of the system. The PR interdependency is realized by using message passing. The control of message passing is done by means of global replicated data basis. Based on this model, two deterministic algorithms for global scheduling of the PRs are presented: Minimum Processing Delay (MPD) and Execution and Communication Load Balancing (ECLB). It is appreciated that the developed scheduling algorithms contain a sufficient degree of generality so that they can be adapted for other types of communication/synchronization mechanisms and hardware/software structures.
This research was supported in part by the German Research Foundation — Deutsche Forschungsgemeinschaft (DFG) in West Germany — under Grant SO-79–135/1, while the author was with the Electrical Engineering and Computer Science Department, University of Connecticut, USA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
BAKER, KENNETH.,“Introduction to Sequencing and Scheduling ” John Wiley & Sons Inc., New York, 1974.
CHOW, CHIEH-Y., KOHLER, WALTER., “Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System ” IEEE Trans. on Computers, Vol. C-28, No. 5, May 1979.
ENSLOW, P., “What is a Distributed Data Processing System?” Computer, Vol. 11, No. 1, January 1978.
GONZALEZ, MARIO.,“Deterministic Processor Scheduling ” Computing Surveys, Vol. 9, No. 3, Sept. 1977.
HANSEN, PER BRINCH.,“Distributed Processes: A Concurrent Programming Concept ” Comm. of the ACM, November 1978.
HOARE, C.A.R., “Communicating Sequential Processes ” Comm. of the ACM, Aug. 78.
HUEN, W. R., GREENE, P., “Technec: A Network Computer for Distributed Task Control ” 1st Annual Rocky Mount. Sympos. on Micro-computers, Fort Collins, Colorado, September 1977.
KAFURA, D., SHEN, V., “Task Scheduling on Multiprocessing System with Independent Memories ” SIAM Journal, Compt., Vol. 6, No. 1, March 1977
KAIN, R., RAIE, A., GOUDA, M., “Multiple Processor Scheduling Polices ” Proc. 1st Intern. Conf. on Distrib. Comp. Systems, Alabama, October, 1979.
KIM, K.M., NAGHIBZADEH, M., “Prevention of Task Overruns in Real-Time Non-preemptive Multiprogramming Systems ” The 7th IFIP Sympos. on Comp. Performance, PERFORMANCE 80, May 28–30,1980, Toronto, Canada.
LEINBAUGH, DENNIS.,“Guaranteed Response Times in a Hard Real-Time Environment ” IEEE Transactions on Software Engineering, Vol. SE6, Jan. 1980.
LIU, M. T., et. al., “Analysis of the Distributed Loop Computer Network (DLCN) Tech. Rep., Dept. of Comp. & Inf. Sciences, Ohio State Univ., Columbus, Ohio, May 1977.
LE LANN, G., “An Analysis of Different Approaches to Distributed Computing ” Proc. of the 1st Intern. Conf. on Distributed Comp. Systems, Huntsville, AL, October 1979.
SILBERSCHATZ, ABRAHAM.,“Communication and Synchronization in Distributed Systems ” IEEE Trans. on Soft. Eng., November 1979.
SOCEANU, A., “An Approach to Process Scheduling for Real Time Distributed Microcomputer Systems” Technical Report, CS-80–10, University of Connecticut, Dept. EECS, July 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soceanu, A. (1981). Model-based Load Scheduling Algorithms for Real-Time Distributed Microcomputer Systems. In: Mertens, B. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik-Fachberichte, vol 41. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67979-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-67979-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10619-7
Online ISBN: 978-3-642-67979-7
eBook Packages: Springer Book Archive