The Allocation and Scheduling Precedence and Timing-Constrained Tasks with communication Delays

I
ICECCS
1996
Second IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'96)
Abstract - The Allocation and Scheduling Precedence and Timing-Constrained Tasks with communication Delays

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by B.-C. Cheng Articles by T. Marlowe Articles by A. Stoyenko Articles by S. Baruah

Second IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'96)

Montreal, CANADA

October 21-October 25

ISBN: 0-8186-7614-0

	ASCII Text	x
	B.-C. Cheng, T. Marlowe, A. Stoyenko, S. Baruah, "The Allocation and Scheduling Precedence and Timing-Constrained Tasks with communication Delays," Engineering of Complex Computer Systems, IEEE International Conference on, pp. 91, Second IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'96), 1996.

	BibTex	x
	@article{ 10.1109/ICECCS.1996.558389, author = {B.-C. Cheng and T. Marlowe and A. Stoyenko and S. Baruah}, title = {The Allocation and Scheduling Precedence and Timing-Constrained Tasks with communication Delays}, journal ={Engineering of Complex Computer Systems, IEEE International Conference on}, volume = {0}, year = {1996}, isbn = {0-8186-7614-0}, pages = {91}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICECCS.1996.558389}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Engineering of Complex Computer Systems, IEEE International Conference on TI - The Allocation and Scheduling Precedence and Timing-Constrained Tasks with communication Delays SN - 0-8186-7614-0 SP EP A1 - B.-C. Cheng, A1 - T. Marlowe, A1 - A. Stoyenko, A1 - S. Baruah, PY - 1996 VL - 0 JA - Engineering of Complex Computer Systems, IEEE International Conference on ER -

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICECCS.1996.558389

The problem of non-preemptively scheduling a set of n tasks on m identical processors with communication overhead subject to precedence and deadline constraints is considered. A new heuristic with the time complexity of O(n2m), Least Space-Time First (LSTLP), is pro-posed to minimize the maximum tardiness. From simulation results, it is shown that LSTF outperforms other heuristic algorithms. overhead subject to precedence and deadline constraints is considered. A new heuristic with the time complexity of O(n2m), Least Space-Time First (LSTLP), is pro-posed to minimize the maximum tardiness. From simulation results, it is shown that LSTF outperforms other heuristic algorithms.

Citation:

B.-C. Cheng, T. Marlowe, A. Stoyenko, S. Baruah, "The Allocation and Scheduling Precedence and Timing-Constrained Tasks with communication Delays," iceccs, pp.91, Second IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'96), 1996

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.