
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D.T. Peng, K.G. Shin, "Optimal Scheduling of Cooperative Tasks in a Distributed System Using an Enumerative Method," IEEE Transactions on Software Engineering, vol. 19, no. 3, pp. 253267, March, 1993.  
BibTex  x  
@article{ 10.1109/32.221134, author = {D.T. Peng and K.G. Shin}, title = {Optimal Scheduling of Cooperative Tasks in a Distributed System Using an Enumerative Method}, journal ={IEEE Transactions on Software Engineering}, volume = {19}, number = {3}, issn = {00985589}, year = {1993}, pages = {253267}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.221134}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Optimal Scheduling of Cooperative Tasks in a Distributed System Using an Enumerative Method IS  3 SN  00985589 SP253 EP267 EPD  253267 A1  D.T. Peng, A1  K.G. Shin, PY  1993 KW  cooperative tasks; enumerative method; processing nodes; distributed system; common goal; intertask communications; precedence constraints; normalized task response time; system hazard; PERT/CPM form; activity on arc; AOA; task graph; dominance relationship; simultaneously schedulable modules; active schedules; optimal schedule; task scheduling problem; computational experiences; distributed processing; PERT; realtime systems; scheduling VL  19 JA  IEEE Transactions on Software Engineering ER   
Preemptive (resume) scheduling of cooperative tasks that have been preassigned to a set of processing nodes in a distributed system, when each task is assumed to consist of several modules is discussed. During the course of their execution, the tasks communicate with each other to collectively accomplish a common goal. Such intertask communications lead to precedence constraints between the modules of different tasks. The objective of this scheduling is to minimize the maximum normalized task response time, called the system hazard. Realtime tasks and the precedence constraints among them are expressed in a PERT/CPM form with activity on arc (AOA), called the task graph (TG), in which the dominance relationship between simultaneously schedulable modules is derived and used to reduce the size of the set of active schedules to be searched for an optimal schedule. Lowerbound costs are estimated, and are used to bound the search. An example of the task scheduling problem and some computational experiences are presented.
[1] K.G. Shin, C.M. Krishna, and Y.H. Lee, "A Unified Method for Evaluating RealTime Computer Controllers and Its Application,"IEEE Trans. Automatic Control, Vol. AC30, No. 4, Apr. 1985, pp. 357366.
[2] D.T. Peng and K. G. Shin, "Static allocation of periodic tasks with precedence constraints in distributed realtime systems,"IEEE Proc. 9th Int. Conf. Distrib. Computing Syst., 1989, pp. 190198.
[3] D. T. Peng, "Modeling, assignment and scheduling of tasks in distributed realtime systems," Ph.D. dissertation, Dept. of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI, Dec. 1989.
[4] H. A. Taha,Operations Research: An Introduction. New York: Macmillan, 1976.
[5] K. R. Baker,Introduction to Sequencing and Scheduling. New York: Wiley, 1974.
[6] R. Bellman, A. O. Esogbue, and I. Nabeshima,Mathematical Aspects of Scheduling and Applications. Elmsford, NY: Pergamon, 1982.
[7] T. Gonzalez and S. Sahni, "Flowshop and jobshop schedules: Complexity and approximation,"Operations Res., vol. 26, no. 1, Jan.Feb. 1978, pp. 3652.
[8] J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker, "Complexity of machine scheduling problems,"Ann. Discrete Math., vol. 1, pp. 343362, 1977.
[9] K. R. Bakeret al., "Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints,"Operations Res., vol. 31, no. 2, Mar.Apr. 1983, pp. 381386.
[10] J. Blazewicz, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Scheduling subject to resource constraints: Classification and complexity,"Discrete Applied Math., vol. 5, 1983, pp. 1124.
[11] B. Giffler and G. L. Thompson, "Algorithms for solving production scheduling problems,"Operations Res., vol. 8, no. 4, pp. 487503, 1960.
[12] G. H. Brooks and C. R. White, "An algorithm for finding optimal or near optimal solutions to the production scheduling problems,"J. Indust. Eng., vol. 16, 1965, pp. 3440.
[13] L. Schrage, "Solving resourceconstrained network problems by implicit enumerationNonpreemptive case,"Operations Res., vol. 18, pp. 263278, 1970.
[14] L. Schrage, "Solving resourceconstrained network problems by implicit enumerationPreemptive case,"Operations Res., vol. 20, pp. 668677, 1972.
[15] E. L. Lawleret al., "Recent developments in deterministic sequencing and scheduling: A survey," inDeterministic and Stochastic Scheduling, Dempsteret al., Eds. Dordrecht, The Netherlands: Reidel, 1982, pp. 3574.
[16] B. J. Lageweg, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Jobshop scheduling by implicit enumeration,"Management Scie., vol. 24, no. 4, pp. 441450, 1977.
[17] J. P. Tremblay and R. Manohar,Discrete Mathematical Structures with Applications to Computer Science, New York: McGrawHill, 1987.
[18] W. H. Kohler and K. Steiglitz, "Enumerative and interactive computational approach," inComputer and JobShop Scheduling Theory, Coffman Eds. New York: Wiley, 1976, pp. 229287.