Xiangdong Yu
- 1.F. Afrati, C.H. Papadimitrou and G. Papageorgiou, Scheduling DAGS to Minimize time and communication, Technical Report, National Technical University of Athens, Athens, Greece, 1985.Google Scholar
- 2.S. Bhatt and J. Cai, "Take a walk, Grow a Tree", FOCS, 1988, pp. 469-478.Google ScholarDigital Library
- 3.S. Bhatt, F. Chung, T.Leighton, and A. Rosenberg, Optimal Simulations of Tree Machines, FOCS, 1986, pp. 274-282.Google ScholarDigital Library
- 4.S. Bhatt, D. Greenberg, T.Leighton, and P. Liu, Tight Bounds for On-line Tree Embeddings, SODA, 1990, pp. 344-350. Google ScholarDigital Library
- 5.S. Bhatt, and I. Ipsen, Embedding Trees in the Hypercube, YALE University Research Report nn- S (1985).Google Scholar
- 6.M.Y. Chan, Embedding of Grids into Optimal Hypercubes, SIAM Journal on Compuling, Vol 20, No 5, Oct., 1991, pp. 834-864. Google ScholarDigital Library
- 7.E. G. Coffman and P. J. Denning, Operating System Theory, Prentice-Hall Inc., 1973. Google ScholarDigital Library
- 8.A.L.Fisher and H.T.Kung, Synchronizing Large VLSI Array Processor, Proc. of l Oth Annual IEEE/ACM Symposzum on Computer Architecture,1983, pp.54-58. Google ScholarDigital Library
- 9.A. Feldmann, J. Sgall, and S. Teng, "Dynamic Scheduling on Parallel Machines", FOCS 91, pp. 111-120. Google ScholarDigital Library
- 10.D. Ghosal, A. Mukherjee, R. Thurimella, and Y. Yesha, Mapping Task Trees onto a Linear Array, 1991 Int'l Conference on Parallel Processing, August 1991.Google Scholar
- 11.M. R. Garey and D. S. johnson, Computers and Intractability : A Guide to Theory of NP-Completeness. San Francisco, CA, Freeman Publishing Co., 1979. Google ScholarDigital Library
- 12.K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing, McGRA W- Hill International Editions, 1987. Google ScholarDigital Library
- 13.W. D. 1-Iillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.Google Scholar
- 14.J. Hong, K. Melhorn, and A.L. Rosenberg, Cost trade-offs in graph embeddings, with applications, JACM, 30, 1983, pp. 709-728. Google ScholarDigital Library
- 15.T. C. Hu. Parallel Sequencing and Assembly Line Problem, Operations ttesearch, Vol. 9, Nov. 1961, pp. 841-848.Google Scholar
- 16.S.R.Kosaraju and A.L.Delcher, Optimal Parallel Evaluation of Tree-Structured Computations by Raking, Lecture Notes 319, AWOC 88, Springer-Veriag, 1988, pp.101-110. Google ScholarDigital Library
- 17.R.Koch, T. Leighton, B.Maggs, S.Rao, and A.Rosenberg, Work-Preserving Emulations of Fixed-Connection Networks, STOC, 1989, pp. 227-240. Google ScholarDigital Library
- 18.H. Kasahara and S. Narit, Practical Multiprocc~or Scheduling Algorit~hm~ for Efficient Parallel Processing, IEEE Transactions on Computers, c-a3(11), Nov. 1984, pp. 1023-1029.Google Scholar
- 19.MASPAR- The massively parallel architecture, MASPAR Inc. 1990.Google Scholar
- 20.G.L. Miller and J.H.Reif, Parallel Tree Contraction and its Application, Proc. of 26~h IEEE Symposium on Foundations of Computer Science, 1985, pp.478-489.Google Scholar
- 21.C.H. Papadimitriou and J.D. Ullman, A communication time tradeoff, SIAM or. of Computing, 16 (4), 1987, pp. 639-646. Google ScholarDigital Library
- 22.C. C. Shen and W. H. Tsai, A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minmax Criterion, IEEE Transactions on Computers, c-34(3), March 1985, pp. 197-203.Google Scholar
- 23.D. Shmoys, J. Wein, and D. Williamson, "Scheduling Parallel Machine On-line", FOCS 91, pp. 131-140. Google ScholarDigital Library
- 24.A. Wagner, Embedding arbitrary binary trees in a Hypercube, J. of Parallel and Distributed Computing, 7, 1989, pp. 503-520.Google ScholarCross Ref
- 25.I.-C. Wu and tt.T. Kung, "Communication Complexity for Parallel Divide-and-Conquer", FOCS 91, pp. 151-162. Google ScholarDigital Library
Index Terms
- Optimal dynamic scheduling of task tree on constant-dimensional architectures
Recommendations
Fair scheduling of dynamic task systems on multiprocessors
Special issue: Parallel and distributed real-time systemsIn dynamic real-time task systems, tasks that are subject to deadlines are allowed to join and leave the system. In previous work, Stoica et al. and Baruah et al. presented conditions under which such joins and leaves may occur in fair-scheduled ...
Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors
Abstract--In fixed-priority scheduling, the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization ...
Comments