Abstract
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.
Work supported by the “Human Capital and Mobility” MAP project.
Chapter PDF
References
R.K. Ahija, T.L. Magnanti and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, New York, 1992.
P. Barcaccia and M.A. Bonuccelli. “Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems”. ACM/IEEE Transactions on Networking, 2, 247–251, 1994.
G. Bongiovanni, D. Coppersmith and C.K. Wong. “An optimal time slot assignment algorithm for a SS/TDMA system with variable number of transponders”. IEEE Transactions on Communication, 29, 721–726, 1981.
M.A. Bonuccelli, I.S. Gopal and C.K. Wong. “Incremental time slot assignment in SS/TDMA satellite systems”. IEEE Transactions on Communication, 39, 1147–1156, 1991.
M.A. Bonuccelli. “A fast time slot assignment algorithm for TDM hierarchical switching systems”. IEEE Transactions on Communication, 37, 870–874, 1989.
G. Bongiovanni, D.T. Tang and C.K. Wong. “A general multibeam satellite switching algorithm” IEEE Transactions on Communication, 29, 1025–1036, 1981.
W.T. Chen, P.R. Sheu and J.H. Yu. “Time slot assignment in TDM multicast switching systems”. IEEE Transactions on Communication, 42, 149–165, 1994.
M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
H. Gabow, T. Nishizeki, O. Kariv, D. Leven and O. Terada. “Algorithms for edge coloring graphs”. Technical Report 41/85, University of Colorado, 1985.
K. Hwang. Advanced Computer Architecture. McGraw-Hill Book Company, New York, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barcaccia, P., Bonuccelli, M.A., Di Ianni, M. (1996). Minimum length scheduling of precedence constrained messages in distributed systems. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024753
Download citation
DOI: https://doi.org/10.1007/BFb0024753
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive