Task assignment with precedence relations in distributed computing systems

References

• Bokahari , S.H. 1979 . “Dual Processor Scheduling with Dynamic Reassignment,” . IEEE Trans. Software Eng , SE‐5 : 341 – 349 .
   Google Scholar
• Chen , W.T. and Sheu , J.P. 1987 . “Task Assignment in Loosely‐Coupled Multiprocessor Systems,” . J. Chin, Inst. Eng. , 10 ( 6 ) : 721 – 726 .
   Google Scholar
• Chu , W.W. , Holloway , L.J. , Lan , M.T. and Efe , K. 1980 . “Task Allocation in Distributed Data Processing,” . Comput. , 13 : 57 – 69 .
   Google Scholar
• Chu , W.W. and Lan , L.M. 1987 . “Task Allocation and Precedence Relations for Distributed Real‐Time Systems,” . IEEE Trans. Comput. , Vol. C‐36 ( 6 ) : 667 – 679 .
   Google Scholar
• Efe , K. 1982 . “Heuristic Models of Task Assignment Scheduling in Distributed Systems,” . Comput. , 15 : 50 – 56 .
   Web of Science ®Google Scholar
• Ezzat , A.K. , Bergeron , R.D. and Pokoski , J.L. “Task Allocation Heuristics for Distributed Computing Systems,” . Proc. 6th Int. Conf. Distrib. Comput. Syst. Cambridge, MA. pp. 337 – 346 .
   Google Scholar
• Garey , M.R. and Johnson , D.S. 1979 . Computers and Intractability: A Guide to the Theory of NP‐Completeness , San Francisco : Freeman .
   Google Scholar
• Hsu , C.C. , Wang , S.D. and Kuo , T.S. 1989 . “Efficient Task Assignment for Distributed Computing System,” . J. Chin. Inst. Eng , 12 ( 3 ) : 317 – 329 .
   Google Scholar
• Hsu , C.C. , Wang , S.D. and Kuo , T.S. “Minimization of Task Turnaround Time for Distributed Systems,” . Proc. 13th Annu. Int. Comput. Software Appl. Conf . Orlando, Florida. pp. 2 – 7 .
   Google Scholar
• Kasahara , H. and Narita , S. 1984 . “Pratical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing,” . IEEE Trans. Comput. , C‐33 ( 11 ) : 1023 – 1029 .
   Web of Science ®Google Scholar
• Lo , V. and Liu , J.W.S. “Task Assignment in Distributed Multiprocessor System,” . Proc. 1981 Int. Conf. Parallel Process . Columbus, Ohio. pp. 358 – 360 .
   Google Scholar
• Lo , V.M. “Task Assignment to Minimize Completion Time,” . Proc. Int. Conf. Distrib. Comput. Syst. Denver, Colorado. pp. 329 – 336 .
   Google Scholar
• Ma , P.Y.R. , Lee , E.Y.S. and Tsuchiya , M. 1982 . “A Task Allocation Model for Distributed Computing Systems,” . IEEE Trans. Comput. , C‐31 ( 1 ) : 41 – 47 .
   Google Scholar
• Sahni , S. and Gonzalez , T. 1976 . “P‐Complete Approximation Problems,” . J. Assoc. Comput. Mach. , 23 ( 7 ) : 555 – 565 .
   Google Scholar
• Sheild , J. 1987 . “Partitioning Concurrent VLSI Simulation Programs onto a Multiprocessor by Simulated Annealing,” . IEEE Proc , 134 ( 1 ) : 24 – 30 . Pt. E
   Google Scholar
• Shen , C.C. and Tsai , W.H. 1985 . “A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion,” . IEEE Trans. Comput. , C‐34 ( 3 ) : 197 – 203 .
   Google Scholar
• Sinclair , J.B. 1987 . “Efficient Computation of Optimal Assignments for Distributed Tasks,” . J. Parallel Distrib. Comput. , 4 : 342 – 362 .
   Web of Science ®Google Scholar
• Stone , H.S. 1977 . “Multiprocessor Scheduling with the Aid of Network Flow Algorithms,” . IEEE Trans. Software Eng , SE‐3 ( 6 ) : 85 – 93 .
   Google Scholar
• Stone , H.S. and Bokhari , S.H. 1978 . “Control of Distributed Processes,” . Comput. , 11 : 97 – 106 .
   Web of Science ®Google Scholar
• Tanenbaum , A.S. 1981 . Computer Networks , Englewood Cliffs, New Jersey : Prentice‐Hall .
   Google Scholar
• Wang , L.L. and Tsai , W.H. 1988 . “Optimal Assignment of Task Modules with Precedence for Distributed Processing by Graph Matching and State Space Search,” . BIT , 28 : 54 – 68 .
   Web of Science ®Google Scholar
• Correspondence Addressee
   Google Scholar