Advertisement

A flexible scheduler for the Andorra-I system

  • Inês de Castro Dutra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 569)

Abstract

A flexible scheduler for distributing and- and or- parallel work in the Andorra-I system is presented. The scheduler allows workers to move freely between teams. Its strategy is based on estimates of and- and or- parallelism available in the execution tree. Preliminary results show that in most cases we can reach or surpass the best performance of Andorra-I running with any fixed team configuration. Since the teams are configured dynamically and automatically, the user does not need to be concerned with choosing an appropriate configuration. Further work is being done to improve the scheduler by using data obtained from compile-time analysis.

Keywords

And/Or-parallelism Multiprocessors Scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Valmir C. Barbosa and Priscila M. V. Lima. On the Distributed Parallel Simulation of Hopfield's Neural Networks. Software-Practice and Experience, 20(10):967–983, October 1990.Google Scholar
  2. [2]
    Anthony Beaumont, S. Muthu Raman, and Péter Szeredi. Flexible Scheduling of Or-Parallelism in Aurora: The Bristol Scheduler. Technical Report to be published, University of Bristol, Computer Science Department, October 1990.Google Scholar
  3. [3]
    Per Brand. Wavefront scheduling. 1988. Internal Report, Gigalips Project.Google Scholar
  4. [4]
    Maurice Bruynooghe. A Practical Framework for the Abstract Interpretation of Logic Programs. Journal of Logic Programming, 10(2):91–124, February 1991.Google Scholar
  5. [5]
    Ralph Butler, Terry Disz, Ewing Lusk, Robert Olson, Ross Overbeek, and Rick Stevens. Scheduling OR-parallelism: an Argonne perspective. In Proceedings of the Fifth International Conference on Logic Programming, pages 1590–1605, MIT Press, August 1988.Google Scholar
  6. [6]
    Felipe M. G. França. A Self-Organising Updating Network. In International Conference on Artificial Neural Networks, ICANN 91, Helsinki, 1991.Google Scholar
  7. [7]
    Alan Calderwood. Aurora—description of scheduler interfaces. January 1988. Internal Report, Gigalips Project.Google Scholar
  8. [8]
    Alan Calderwood and Péter Szeredi. Scheduling or-parallelism in Aurora — the Manchester scheduler. In Proceedings of the Sixth International Conference on Logic Programming, pages 419–435, MIT Press, June 1989.Google Scholar
  9. [9]
    Saumya K. Debray, Nai-Wei Lin, and Manuel Hermenegildo. Task granularity analysis in logic programs. In Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation, pages 174–188, June 1990.Google Scholar
  10. [10]
    Inês de Castro Dutra. Design of a Flexible Scheduler for Andorra-I. January 1991. Internal Report, ESPRIT Project 2471, PEPMA.Google Scholar
  11. [11]
    Bogumil Hausman. Pruning and Speculative Work in OR-Parallel PROLOG. PhD thesis, The Royal Institute of Technology, Stockholm, 1990.Google Scholar
  12. [12]
    J. J. Hopfield. Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proc. Natl. Acad. Sci., USA, 79:2554–2558, April 1982.Google Scholar
  13. [13]
    Hung Khei Huang and Valmir Carneiro Barbosa. Static Task Allocation in Heterogeneous Distributed Systems. Technical Report ES-149/88, Federal University of Rio de Janeiro, COPPE/Sistemas, 1988.Google Scholar
  14. [14]
    Yannis E. Ioannidis and Eugene Wong. Query Optimization by Simulated Annealing. In SIGMOD — Proceedings of the 1987 International Conference on Management of Data, pages 9–22, ACM, 1987.Google Scholar
  15. [15]
    G. J. Lipovsky and M. V. Hermenegildo. B-LOG: A Branch and Bound Methodology for the Parallel Execution of Logic Programs. In Proceedings of the 1985 International Symposium on Logic Programming, pages 560–567, IEEE, 1985.Google Scholar
  16. [16]
    Ewing Lusk, David H. D. Warren, Seif Haridi, et al. The Aurora or-parallel Prolog system. New Generation Computing, 7(2,3):243–271, 1990.Google Scholar
  17. [17]
    Douglas Pase and Peter Borgwardt. Load Balancing Heuristics and Networks Topologies for Distributed Evaluation of Prolog. Technical Report, Imperial College, Department of Computer Science. Available as TR: Parallel Logic Programming 57, Parlog Group.Google Scholar
  18. [18]
    V. Santos Costa, D. H. D. Warren, and R. Yang. The Andorra-I Engine: A parallel implementation of the Basic Andorra model. In Logic Programming: Proceedings of the 8th International Conference, MIT Press, 1991.Google Scholar
  19. [19]
    V. Santos Costa, D. H. D. Warren, and R. Yang. The Andorra-I Preprocessor: Supporting full Prolog on the Basic Andorra model. In Logic Programming: Proceedings of the 8th International Conference, MIT Press, 1991.Google Scholar
  20. [20]
    Vítor Santos Costa and Rong Yang. Andorra-I User's Guide and reference manual. Technical Report, University of Bristol, Computer Science Department, Sept 1990. Internal Report, Gigalips Project.Google Scholar
  21. [21]
    Raed Sindaha. Scheduling speculative work in the Aurora or-parallel Prolog system. March 1990. Internal Report, Gigalips Project, University of Bristol.Google Scholar
  22. [22]
    Péter Szeredi and Mats Carlsson. The Engine-Scheduler Interface in the Aurora Or-Parallel Prolog System. Technical Report TR-90-09, University of Bristol, Computer Science Department, April 1990.Google Scholar
  23. [23]
    Péter Szeredi, Mats Carlsson, and Rong Yang. Interfacing engines and schedulers in or-parallel prolog systems. In PARLE91: Conference on Parallel Architectures and Languages Europe, Springer Verlag, June 1991.Google Scholar
  24. [24]
    Evan Tick. Compile Time Granularity Analysis for Parallel Logic Programming Systems. In International Conference on Fifth Generation Computer Systems 1988, ICOT, 1988.Google Scholar
  25. [25]
    David H. D. Warren. Oct 90. Personal Communication.Google Scholar
  26. [26]
    David H. D. Warren. The Andorra model. March 1988. Presented at Gigalips Project workshop, University of Manchester.Google Scholar
  27. [27]
    R. Warren, M. Hermenegildo, and S. Debray. On the practicality of global flow analysis of logic programs. In Proceedings of the Fifth International Conference on Logic Programming, MIT Press, August 1988.Google Scholar
  28. [28]
    Rong Yang. Programming in Andorra-I. August 1988. Internal Report, Gigalips Project.Google Scholar
  29. [29]
    Rong Yang. Solving simple substitution ciphers in Andorra-I. In Proceedings of the Sixth International Conference on Logic Programming, pages 113–128, MIT Press, June 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Inês de Castro Dutra
    • 1
  1. 1.Department of Computer ScienceUniversity of BristolBristol

Personalised recommendations