A heuristic cost estimation method for optimizing assignment of tasks to processors

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A heuristic cost estimation method for optimizing assignment of tasks to processors

Full text

Pdf (563 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1999 ACM symposium on Applied computing table of contents

San Antonio, Texas, United States

Pages: 358 - 364

Year of Publication: 1999

ISBN:1-58113-086-4

Authors

Larry Dunning	Department of Computer Science, Bowling Green State University, Bowling Green, OH
Sub Ramakrishnan	Department of Computer Science, Bowling Green State University, Bowling Green, OH

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 20, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

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/298151.298384 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	C. C. Shen, W. H. Tsai, "A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems using a Minimax Criterion", IEEE Trans. on Computers, vol. C-34, no. 3, pp. 197-203, March 1985.
	2	L Dunning, S Ramakrishnan, On the Complexity of Stone's Task Assignment Problem, Journal' Congresses Numeratum, Vol 111, pp 41-48, 1995.
	3	Sub Ramakrishnan , Larry Dunning , Pratap Thondapu , Ching Yue, A hybrid task allocation strategy for delay optimization in distributed computer systems, Proceedings of the IFIP TC6 Working Conference on Computer Networks, Architecture, and Applications. on Computer networks, architecture and applications, p.55-65, January 1993, Trivandrum, India
	4	S. Ramakrishnan, L Dunning, An extended A* Model for Task Allocation, Principles of Distributed Computer Systems, Orlando, FL, September 1995, pp. 66-69.
	5	D. Fernandez-Baca, Allocating Modules to Processors in a Distributed System, IEEE Transactions on Software Engineering, v.15 n.11, p.1427-1436, November 1989 [doi>10.1109/32.41334]
	6	V. M. Lo, Heuristic Algorithms for Task Assignment in Distributed Systems, IEEE Transactions on Computers, v.37 n.11, p.1384-1397, November 1988 [doi>10.1109/12.8704]
	7	P. Ma, E. Lee, J. Tsuchiya, "A Task Allocation Model for Distributed Computing Systems", IEEE Trans. on Computers, vol C-31, no.l, pp. 41-47, January 1982.
	8	S. Ramakrishnan, L. Dunning, I. Cho, "A Close Look at Task Assignment in Distributed Systems", Proceedings of INFOCOMgI~ Miami, FI, pp. 806- 812, April, 1991.
	9	H.S. Stone, "Multiprocessor Scheduling with the Aid of Network Flow Algorithms", IEEE Trans. on Software Eng., vol. 3, no. 1, pp. 85-83, January 1977.
	10	N. J. Nilsson, Principles of artificial intelligence, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1980