Skip to main content
SpringerLink
Log in

Scheduling problems in parallel systems for telecommunications

Scheduling Probleme in parallelen Systemen für Telekommunikation

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The scheduling of the large number of tasks with various cooperation modes poses interesting theoretical problems in parallel systems used in telecommunications. Such systems are fully distributed ones, preventing coherent observability. In such systems no absolute time-space reference exists. The theoretically optimal set of local references is given as the limiting factor for the incoherent observability. The failures and/or modifications inherent in the massively parallel systems may change their configurations dynamically. Thus no optimal algorithms can be developed for the effective utilization of the resources available in such a system. The influence of the granularity level and of the cooperation modes of the processes on scheduling are investigated in order to identify areas for further study.

Zusammenfassung

Das Scheduling einer großcn Anzahl von Tasks mit verschiedenen Kooperationsmoden verursacht interessante theoretische Probleme in parallelen Systemen, so wie sie in der Telekommunikation vorkommen. Diese Systeme sind voll verteilt, was die kohärente Beobachtungsfähigkeit verhindert. In diesen Systemen existiert keine absolute Zeit-Raum Referenz. Die theoretisch optimale Menge der lokalen Referenzen definiert die Schranke der inkohärenten Beobachtungsfähigkeit. Die Ausfälle oder/und Veränderungen, die für massiv parallele Systeme charakteristisch sind, können deren Konfiguration dynamisch modifizieren. Deshalb ist es nicht möglich, optimale Algorithmen für die effektive Nutzung der verfügbaren Ressourcen zu entwickeln. Der Einfluß des Granularitätsniveaus und der Kooperationsmoden der Prozesse auf das Scheduling wird aufgezeigt, um für weitere Untersuchungen eine Grundlage zu bilden.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Németh, G.: Routing, scheduling, timing and intractability. Proc. MPCS’94, IEEE, pp. 452–462 (1994).

  2. Németh, G.: Formal design methods for distributed resource control algorithms. Proc. 10th IASTED Applied Informatics, Acta Press, pp. 9–12 (1992).

  3. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Comm. ACM21, 558–564 (1978).

    Article  MATH  Google Scholar 

  4. Németh, G.: Parallel architectures and algorithms. Lecture Notes, Innsbruck (1992).

  5. Sha, L., Rajkumar, R., Lehoczky, J. P.: Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans. Comput.39, 1175–1185 (1990).

    Article  MathSciNet  Google Scholar 

  6. Le Lann, G.: Distributed systems — towards a formal approach. Inf. Proc.77, 155–180 (1977).

    Google Scholar 

  7. Peng, D-T., Kang, G. S.: Optimal scheduling of cooperative tasks in a distributed system using an enumerative method. IEEE Trans. Software Eng.19, 253–267 (1993).

    Article  Google Scholar 

  8. Németh, G.: Distributed resource control methods. Lecture notes, Innsbruck (1991).

  9. Xu, J., Parnas, D. L.: On satisfying timing constraints in hard-real-time systems. IEEE Trans. Software Eng.19, 70–84 (1993).

    Article  Google Scholar 

  10. Duran, J. M., Wiser, J.: International standards for intelligent networks. IEEE Comm. Mag.30, 34–42 (1992).

    Article  Google Scholar 

  11. Armstrong, J. Virding, R.: Erlang — an experimental telephony programming language. Proceedings XII International Switching Symposium, Stockholm, 1990, Vol. III, pp. 43–48 (1990).

    Article  Google Scholar 

  12. Ramamoorthy, C. V., Chandy, M. J., Gonzalez Jr.: Optimal scheduling strategies in a multiprocessor system. IEEE Trans. Comput.C-21, 137–146 (1972).

    Article  MathSciNet  Google Scholar 

  13. Fernandez, E. B., Bussell, B.: Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Trans. Comput.C-22, 745–751 (1973).

    Article  MathSciNet  Google Scholar 

  14. Hou, E. S. H., Ansari, N., Ren, H.: A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parallel Distr. Syst.5, 113–120 (1994).

    Article  Google Scholar 

  15. Dacker, B.: Erlang — A new programming language. Ericsson rev.2, 70 (1993).

    Google Scholar 

  16. Sinkovic, V., Lovrek, I.: An approach to massively parallel call and service processing in telecommunications. Proc. MPCS’94, IEEE, pp. 534–537 (1994).

  17. Sinkovic, V., Lovrek, I.: Performance of genetic algorithm used for analysis of call and service processing in telecommunications. Proc. ICANNGA 95, pp. 281–284 (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Telecommunications, Technical University of Budapest, Building St, Szotczek u. 2, H-1111, Budapest, Hungary

    G. Németh

  2. Zagreb

    I. Lovrek & V. Sinkovic

Authors
  1. G. Németh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Lovrek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Sinkovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Németh, G., Lovrek, I. & Sinkovic, V. Scheduling problems in parallel systems for telecommunications. Computing 58, 199–223 (1997). https://doi.org/10.1007/BF02684390

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02684390

AMS Classifications

Key words

Search

Navigation