For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems
Koji GODA Toshinori YAMADA Shuichi UENO
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/04/01
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Algorithms and Data Structures
scheduling, NP-completeness, approximation algorithm,
Full Text: PDF>>
This note considers a problem of minimum length scheduling for a set of messages subject to precedence constraints for switching and communication networks, and shows some improvements upon previous results on the problem.