Generalised multiprocessor scheduling using optimal control

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generalised multiprocessor scheduling using optimal control

Full text

Pdf (1.11 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures table of contents

Hilton Head, South Carolina, United States

Pages: 216 - 228

Year of Publication: 1991

ISBN:0-89791-438-4

Authors

G. N. Srinivasa Prasanna	Laboratory for Computer Science and Research Laboratory for Electronics, Massachusetts Institute of Technology, Cambridge, MA
Bruce R. Musicus	Laboratory for Computer Science and Research Laboratory for Electronics, Massachusetts Institute of Technology, Cambridge, MA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 24, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/113379.113399 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Anant Agarwal , Beng-Hong Lim , David Kranz , John Kubiatowicz, APRIL: a processor architecture for multiprocessing, Proceedings of the 17th annual international symposium on Computer Architecture, p.104-114, May 28-31, 1990, Seattle, Washington, United States
	2	J Blazewicz , M Drabowski , J Weglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, v.35 n.5, p.389-393, May 1986 [doi>10.1109/TC.1986.1676781]
	3	Bryson and Ho. Applied Optimal Control. Halstead Press, 1975.
	4	Coffman E.F., Jr., editor. Computer and Job Shop Scheduling Theory. John Wiley and Sons, N.Y., 1976.
	5	J. Du , J. Y.-T. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics, v.2 n.4, p.473-487, Nov. 1989 [doi>10.1137/0402042]
	6	C.C Han and K.J. Lin. Scheduling Parallelizable Jobs on Multiprocessors. In IEEE Conf. on Real- Time Systems, pages 59-67, 1989.
	7	D. A. Kranz , R. H. Halstead, Jr. , E. Mohr, Mul-T: a high-performance parallel Lisp, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.81-90, June 19-23, 1989, Portland, Oregon, United States
	8	G.N.Srinivasa Prasanna. Structure Driven Multiprocessor Compilation of Numeric Problems. Technical Report MIT/LCS/TR-502, Laboratory for Computer Science, MIT., April 1991.
	9	G.N.Srinivasa Prasanna and Bruce R. Musicus. The Optimal Control Approach to Generalised Multiprocessor Scheduling. To be Published, 1991.

CITED BY 7

	G. N. Srinivasa Prasanna , Bruce R. Musicus, Generalized multiprocessor scheduling for directed acyclic graphs, Proceedings of the 1994 conference on Supercomputing, p.237-246, December 1994, Washington, D.C., United States
	G. N. Srinivasa Prasanna , Bruce R. Musicus, Generalized multiprocessor scheduling for directed acylic graphs, Proceedings of the 1994 ACM/IEEE conference on Supercomputing, November 14-18, 1994, Washington, D.C.
	G. N. Srinivasa Prasanna , B. R. Musicus, Generalized Multiprocessor Scheduling and Applications to Matrix Computations, IEEE Transactions on Parallel and Distributed Systems, v.7 n.6, p.650-664, June 1996
	G. N. Srinivasa Prasanna , A. Agrawal , B. R. Musicus, Hierarchical Compilation of Macro Dataflow Graphs for Multiprocessors with Local Memory, IEEE Transactions on Parallel and Distributed Systems, v.5 n.7, p.720-736, July 1994
	Gregory Mounie , Christophe Rapine , Dennis Trystram, Efficient approximation algorithms for scheduling malleable tasks, Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, p.23-32, June 27-30, 1999, Saint Malo, France
	Klaus Jansen , Hu Zhang, An approximation algorithm for scheduling malleable tasks under general precedence constraints, ACM Transactions on Algorithms (TALG), v.2 n.3, p.416-434, July 2006
	Klaus Jansen , Hu Zhang, Scheduling malleable tasks with precedence constraints, Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA