Abstract
Task parallelism does not automatically scale with the use of parallel processors. Optimised scheduling of tasks is necessary to maximise the utilisation of each available processor. It is common to use heuristics to find solutions for task scheduling problem instances. However, there is no guarantee that the heuristic solution is close to the optimal solution. The outcome of this work is to provide optimal solutions for small and medium sized instances of the task scheduling problem. Two optimal scheduling formulations using Integer Linear Programming (ILP) are proposed for the Multiprocessor Scheduling Problem with Communication Delays: ILP-RevisedBoolean Logic and ILP-Transitivity Clause. ILP-RevisedBooleanLogic is designed to work efficiently when the number of processors available to be scheduled on is small. ILP-TransitivityClause is efficient when a larger number of processors are available to be scheduled on. Each formulation uses a different linearisation of the Integer Bilinear Programming formulation and is tested on CPLEX using known benchmark graphs for task scheduling.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ILOG CPLEX 11.0 User’s Manual. ILOG S.A., Gentilly, France (2007)
Coffman Jr., E.G., Graham, R.L.: Optimal scheduling for two-processor systems. Acta Informat. 1, 200–213 (1972)
Davidović, T., Liberti, L., Maculan, N., Mladenovic, N.: Towards the optimal solution of the multiprocessor scheduling problem with communication delays, pp. 128–135 (2007)
Davidović, T., Crainic, T.G.: Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Comput. Oper. Res. 33, 2155–2177 (2006)
Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. J. ACM 32(3), 505–536 (1985)
Hagras, T., Janecek, J.: A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Parallel Computing 31(7), 653–670 (2005)
Hwang, J.-J., Chow, Y.-C., Anger, F.D., Lee, C.-Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18(2), 244–257 (1989)
Kwok, Y.-K., Ahmad, I.: On multiprocessor task scheduling using efficient state space search approaches. Journal of Parallel and Distributed Computing 65(12), 1515–1532 (2005)
Löwe, W., Zimmermann, W.: Scheduling Iterative Programs onto LogP-Machine. In: Amestoy, P.R., Berger, P., Daydé, M., Duff, I.S., Frayssé, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 332–339. Springer, Heidelberg (1999)
Palmer, A., Sinnen, O.: Scheduling algorithm based on force directed clustering. In: Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2008, pp. 311–318 (December 2008)
Price, C.C., Pooch, U.W.: Search techniques for a nonlinear multiprocessor scheduling problem. Naval Research Logistics Quarterly 29(2), 213–233 (1982)
Radulescu, A., van Gemund, A.J.C.: Low-cost task scheduling for distributed-memory machines. IEEE Transactions on Parallel and Distributed Systems 13(6), 648–658 (2002)
Russell, S.J., Norvig, P.: Artificial intelligence: a modern approach. Prentice Hall (2010)
Sarkar, V.: Partitioning and scheduling parallel programs for multiprocessors. MIT Press (1989)
Shahul, A.Z.S., Sinnen, O.: Scheduling task graphs optimally with A*. Journal of Supercomputing 51(3), 310–332 (2010)
Sinnen, O., Sousa, L.: Scheduling Task Graphs on Arbitrary Processor Architectures Considering Contention. In: Hertzberger, B., Hoekstra, A.G., Williams, R. (eds.) HPCN-Europe 2001. LNCS, vol. 2110, pp. 373–382. Springer, Heidelberg (2001)
Sinnen, O., Sousa, L.: Experimental evaluation of task scheduling accuracy: Implications for the scheduling model. IEICE Transactions on Information and Systems E86-D(9), 1620–1627 (2003)
Sinnen, O.: Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing). Wiley- Interscience (2007)
Yang, T., Gerasoulis, A.: List scheduling with and without communication delays. Parallel Computing 19(12), 1321–1344 (1993)
Zomaya, A.Y., Ward, C., Macey, B.: Genetic scheduling for parallel processor systems: comparative studies and performance issues. IEEE Transactions on Parallel and Distributed Systems 10(8), 795–812 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Venugopalan, S., Sinnen, O. (2012). Optimal Linear Programming Solutions for Multiprocessor Scheduling with Communication Delays. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2012. Lecture Notes in Computer Science, vol 7439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33078-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-33078-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33077-3
Online ISBN: 978-3-642-33078-0
eBook Packages: Computer ScienceComputer Science (R0)