Advertisement

Minimum length scheduling of precedence constrained messages in distributed systems

Extended abstract
  • Piera Barcaccia
  • Maurizio A. Bonuccelli
  • Miriam Di Ianni
Workshop 17 Scheduling and Load Balancing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1124)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R.K. Ahija, T.L. Magnanti and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, New York, 1992.Google Scholar
  2. 2.
    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.CrossRefGoogle Scholar
  3. 3.
    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.CrossRefGoogle Scholar
  4. 4.
    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.CrossRefGoogle Scholar
  5. 5.
    M.A. Bonuccelli. “A fast time slot assignment algorithm for TDM hierarchical switching systems”. IEEE Transactions on Communication, 37, 870–874, 1989.CrossRefGoogle Scholar
  6. 6.
    G. Bongiovanni, D.T. Tang and C.K. Wong. “A general multibeam satellite switching algorithm” IEEE Transactions on Communication, 29, 1025–1036, 1981.CrossRefGoogle Scholar
  7. 7.
    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.CrossRefGoogle Scholar
  8. 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. 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. 10.
    K. Hwang. Advanced Computer Architecture. McGraw-Hill Book Company, New York, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Piera Barcaccia
    • 1
  • Maurizio A. Bonuccelli
    • 2
  • Miriam Di Ianni
    • 1
  1. 1.Dipartimento di Scienze dell'InformazioneUniv. Roma ”La Sapienza”RomaItaly
  2. 2.Dipartimento di InformaticaUniv. PisaPisaItaly

Personalised recommendations