Abstract
This paper presents an extension of the Latency Time (LT) scheduling algorithm for assigning tasks with arbitrary execution times on a multiprocessor with shared memory. The Extended Latency Time (ELT) algorithm adds to the priority function the synchronization associated with access to the shared memory. The assignment is carried out associating with each task a time window of the same size as its duration, which decreases for every time unit that goes by. The proposed algorithm is compared with the Insertion Scheduling Heuristic (ISH). Analysis of the results established that ELT has better performance with fine granularity tasks (computing time comparable to synchronization time), and also, when the number of processors available to carry out the assignment increases.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliographical References
M.J. Geiger and S. Petrovic, An Interactive Multicriteria Optimisation Approach to Scheduling In M. Bramer and V. Devedzic (Eds.), Artificial Intelligence Applications and Innovations. Kluwer Academic Publishers, 475–484, (2004).
L. Ingolotti, P. Tormos, A. Lova, F. Barber, M. A. Salido, and M. Abril, A Decision Support System (DSS) for the Railway Scheduling Problem. Artificial Intelligence Applications and Innovations. Kluwer Academic Publishers, pp. 465–474, (2004).
P. Pinacho, M. Solar, M. Inostroza, and R. Muñoz, Using Genetic Algorithms and Tabu Search Parallel Models to Solve the Scheduling Problem. In M. Bramer and V. Devedzic (Eds.). Artificial Intelligence Applications and Innovations. Kluwer Academic Publishers, 343–358, (2004).
M. Solar and M. Feeley, A Scheduling Algorithm considering Latency Time on a shared Memory Machine, 16th IFIP World Computer Congress 2000, Beijing, China (Aug., 2000).
Y. Kwok and I. Ahmad, Benchmarking and Comparison of the Task Graph Scheduling Algorithms, Journal of Parallel and Distributed Processing, 381–422 (Dec, 1999).
H. Zhou, Scheduling DAGs on a Bounded Number of Processors. Int. Conf. on Parallel and Distributed Processing, Techniques and Applications, Sunnyvale (Aug. 1996).
T. Yang and A. Gerasoulis, List Scheduling with and without Communication Delays, Parallel Computing, vol. 19 (1993).
B. Kruatrachue and T. Lewis, Duplication Scheduling Heuristics: A New Precedence Task Scheduler for Parallel Processor Systems, Technical Report, Oregon State University (1987).
M. Wu and D. Gajski, Hypertool: A Programming Aid for Message-Passing Systems, IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 3 (July, 1990).
T. Yang and A. Gerasoulis, DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors, IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9 (Sept. 1994).
I., Zuccar; M. Solar, V. Parada, A scheduling algorithm for arbitrary graphs on a shared memory machine, Chilean Computing Week, Punta Arenas, Chile, November, (2001).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Zuccar, I., Solar, M., Kri, F., Parada, V. (2006). A Shared-Memory Multiprocessor Scheduling Algorithm. In: Debenham, J. (eds) Professional Practice in Artificial Intelligence. IFIP WCC TC12 2006. IFIP International Federation for Information Processing, vol 218. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34749-3_33
Download citation
DOI: https://doi.org/10.1007/978-0-387-34749-3_33
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34655-7
Online ISBN: 978-0-387-34749-3
eBook Packages: Computer ScienceComputer Science (R0)