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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Németh, G.: Routing, scheduling, timing and intractability. Proc. MPCS’94, IEEE, pp. 452–462 (1994).
Németh, G.: Formal design methods for distributed resource control algorithms. Proc. 10th IASTED Applied Informatics, Acta Press, pp. 9–12 (1992).
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Comm. ACM21, 558–564 (1978).
Németh, G.: Parallel architectures and algorithms. Lecture Notes, Innsbruck (1992).
Sha, L., Rajkumar, R., Lehoczky, J. P.: Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans. Comput.39, 1175–1185 (1990).
Le Lann, G.: Distributed systems — towards a formal approach. Inf. Proc.77, 155–180 (1977).
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).
Németh, G.: Distributed resource control methods. Lecture notes, Innsbruck (1991).
Xu, J., Parnas, D. L.: On satisfying timing constraints in hard-real-time systems. IEEE Trans. Software Eng.19, 70–84 (1993).
Duran, J. M., Wiser, J.: International standards for intelligent networks. IEEE Comm. Mag.30, 34–42 (1992).
Armstrong, J. Virding, R.: Erlang — an experimental telephony programming language. Proceedings XII International Switching Symposium, Stockholm, 1990, Vol. III, pp. 43–48 (1990).
Ramamoorthy, C. V., Chandy, M. J., Gonzalez Jr.: Optimal scheduling strategies in a multiprocessor system. IEEE Trans. Comput.C-21, 137–146 (1972).
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).
Hou, E. S. H., Ansari, N., Ren, H.: A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parallel Distr. Syst.5, 113–120 (1994).
Dacker, B.: Erlang — A new programming language. Ericsson rev.2, 70 (1993).
Sinkovic, V., Lovrek, I.: An approach to massively parallel call and service processing in telecommunications. Proc. MPCS’94, IEEE, pp. 534–537 (1994).
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).
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02684390