Optimal Task Scheduling Algorithm for Parallel Processing

Conference paper
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 145)

Abstract

This paper proposes an optimal task scheduling algorithm for parallel processing. The scheduling problem is formulated as a 0-1 integer problem, where a priority of processing is represented by constraints of the problem. A numerical example shows the effectiveness of the proposing scheduling.

Keywords

Schedule Problem Schedule Algorithm Parallel Processing Priority Relation Short Processing Time 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Viswanathkumar, G., Srinivasan, G.: A branch and bound algorithm to minimize completion time variance on a single processor. Computer&Operations Research 30, 1135–1150 (2003)MathSciNetMATHGoogle Scholar
  2. 2.
    Rakrouki, M.A., Ladhari, T.: A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates. In: International Conference on Computer & Industrial Engineering (2009)Google Scholar
  3. 3.
    Park, C.-I., Choe, T.-Y.: An Optimal Scheduling Algorithm Based on Task Duplication. IEEE Trans. Computers 51(4), 44–448 (2002)Google Scholar
  4. 4.
    Bajaj, R., Agrawal, D.P.: Improving Scheduling of Tasks in a Heterogeneous Environment. IEEE Trans. on Parallel and Distributed Systems 15(2), 107–118 (2004)CrossRefGoogle Scholar
  5. 5.
    Han, J.-J., Wang, D.-Q.: Edge Scheduling Algorithms in Parallel and Distributed Systems. In: Proc. International Conf. Parallel Processing, ICPP 2006 (2006)Google Scholar
  6. 6.
    Beaumont, O., Legrand, A., Robert, Y.: Optimal algorithms for scheduling divisible workloads on heterogeneous systems. In: IEEE Proc. International Paralell and Distributed Processing (2003)Google Scholar
  7. 7.
    Kasahara, H., Narita, S.: Practical Multiprocessor scheduling algorithms. IEEE Trans.Comput, C-33(11), 1023–1029 (1984)Google Scholar
  8. 8.
    Kasahara, H., Narita, S., Hashimoto, S.: OSCAR’s Architecture. Trans. IEICE J71-D-I(8) (August 1988)Google Scholar
  9. 9.
    Sugeta, N., Rokusawa, K.: Decision of Task Priority Orders in CP/MISF Method. In: FIT 2006, p. 87 (2006); B_009 (in Japanese)Google Scholar
  10. 10.
    Shioda, H., Sawada, K., Shin, S.: Optimal Schedule of Parallel Processing. In: 2010 IRAST International Congress on Computer Applications and Computational Science (CACS 2010), pp. 360–363 (2010)Google Scholar
  11. 11.
    El-Rewini, H., Lewis, T.G.: Distiributed and Parallel ComputingGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Mechanical Engineering and Intelligent SystemsThe University of Electro-CommunicationsTokyoJapan
  2. 2.Department of Computer ScienceKogakuin UniversityTokyoJapan

Personalised recommendations