Minimum length scheduling of precedence constrained messages in distributed systems
In a multiprocessor system, collisions occur because of simultaneous transmissions or receptions of two or more messages through the same port: messages are corrupted and must be retransmitted. Collisions can be avoided only by a proper scheduling of the messages. In this paper, minimum length schedulings of a set of communication requests subject to precedence constraints are studied. In particular, we first prove some complexity results and then we present some fast heuristics, assessing their average performance by means of computer simulation. The experimental results show that the heuristics perform quite well, and their expected values are very close to the average optimum.
Unable to display preview. Download preview PDF.
- 1.R.K. Ahija, T.L. Magnanti and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, New York, 1992.Google Scholar
- 8.M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.Google Scholar
- 9.H. Gabow, T. Nishizeki, O. Kariv, D. Leven and O. Terada. “Algorithms for edge coloring graphs”. Technical Report 41/85, University of Colorado, 1985.Google Scholar
- 10.K. Hwang. Advanced Computer Architecture. McGraw-Hill Book Company, New York, 1993.Google Scholar