Abstract
This paper investigates the problem of autonomously allocating a large number of independent, equal sized tasks on a distributed heterogeneous grid-like platform, using only local information. We propose A-FAST (Autonomous Flow Approach to Scheduling Tasks), an efficient, scalable, dynamic and generic (imposing no restrictions on the topology) protocol for this purpose. Motivated by the idea of pressure guiding the flow in fluid networks, A-FAST only uses parameters available locally to a node to guide scheduling decisions. Simulations show that the protocol performs well over a variety of networks, averaging more than 99.5% of the optimal performance and outperforms related techniques like RID (Receiver Initiated Diffusion). We also show how a modified use of local information can improve the performance of an unreliable system. Preliminary results from implementing A-FAST on a small but real-life distributed system show the performance of our protocol to be near the maximum throughput of the system. Such a protocol has the potential to aid the efficient deployment of large, data intensive applications on very large or dynamically changing heterogeneous peer-to-peer computing platforms.
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
Andresen, D., McCune, T.: Towards a Hierarchical Scheduling System for Distributed WWW Server Clusters. In: Proceedings of the Seventh International Symposium on High Performance Distributed Computing (HPDC-7) (July 1998)
Baldeschwieler, J., Blumofe, R., Brewer, E.: ATLAS: An Infrastructure for Global Computing. In: Proceedings of the Seventh ACM SIGOPS European Workshop on System Support for Worldwide Applications (1996)
Baninio, C., Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Robert, Y.: Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms. In: IEEE Transactions on Parallel and Distributed Systems (April 2004)
Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Robert, Y.: Bandwidth-centric Allocation of Independent Task on Heterogeneous Platforms. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2002), Fort Lauderdale, Florida (April 2002)
Blumofe, R., Joerg, C., Kuszmaul, B., Leiserson, C., Randall, K., Zhou, Y.: Cilk: An Efficient Multithreaded Runtime System. In: Proceedings of the 5th Symposium on Principles and Practice of Parallel Programming (1995)
Casanova, H., Legrand, A., Zagorodnov, D., Berman, F.: Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. In: Proceedings of the 9th Heterogeneous Computing Workshop (HCW 2000) (May 2000)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Edmonds, J., Karp, R.M.: Theoretical improvements in the algorithmic efficiency for network flow problems. Journal of the ACM (JACM) 19 (1972)
Entropia Inc. (2001), http://www.entropia.com
Flynn Hummel, S., Schmidt, J., Uma, R., Wein, J.: Load-Sharing in Heterogeneous Systems via Weighted Factoring. In: Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1996) (June 1996)
Goldberg, A.V.: Efficient Graph Algorithms for Sequential and Parallel Computers. PhD thesis, Department of Electrical Engineering and Computer Science, MIT (1987)
Hagerup, T.: Allocating Independent Tasks to Parallel Processors: An Experimental Study. Journal of Parallel and Distributed Computing 47 (1997)
Heil, H.-U., Schmitz, M.: Decentralized Dynamic Load Balancing: The Particles Approach. In: Proc. 8th Int. Symp. on Computer and Information Sciences (1993)
Ibarra, O.H., Kim, C.E.: Heuristic algorithms for scheduling independent tasks on non-identical processors. Journal of the ACM (JACM) 24(2) (1997)
Ford Jr., L.R., Fulkerson, D.R.: Flow in Networks. Princeton University Press, Princeton (1962)
Kreaseck, B., Casanova, H., Carter, L., Ferrante, J.: Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-task Applications. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France (April 2003)
Kruskal, C.P., Weiss, A.: Allocating Independent Subtasks on Parallel Processors. IEEE Transactions on Software Engineering 11 (1984)
Lin, F.C.H., Keller, R.M.: The gradient model load balancing method. IEEE Trans. Softw. Eng. 13(1), 32–38 (1987)
Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.: Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems. In: 8th Heterogeneous Computing Workshop (HCW 1999), April 1999, pp. 30–44 (1999)
Max-Flow-Solution, http://elib.zib.de/pub/Packages/mathprog/maxflow/index.html
Mercenne Prime Search, http://www.mercenne.com
Willebeek-LeMair, M.H., Reeves, A.P.: Strategies for Dynamic Load Balancing on Highly Parallel Computers. Parallel and Distributed Systems, IEEE Transactions (1993)
Network Emulator, http://clarinet.u-strasbg.fr/nem/
Rosenberg, A.: Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better. In: Proceedings of the IEEE International Conference on Cluster Computing (Cluster 2001), Newport Beach, California (October 2001)
SETI@home (2001), http://setiathome.ssl.berkeley.edu
Shiloach, Y., Vishkin, U.: An O(n 2 log n) parallel max-flow algorithm. Journal of Algorithms 3 (1982)
Shu, W., Kale, L.V.: A dynamic scheduling strategy for the chare-kernel system. In: Proceedings of the 1989 ACM/IEEE conference on Supercomputing, pp. 389–398. ACM Press, New York (1989)
van Nieuwpoort, R., Kielmann, T., Bal, H.E.: Satin: Efficient parallel divide-and-conquer in java. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 690–699. Springer, Heidelberg (2000)
Veeravalli, B., Ghose, D., Robertazzi, T.G.: Divisible load theory: A new paradigm for load scheduling in distributed systems. Cluster Computing 6(1) (January 2003)
Wayne, K.D.: Generalized Maximum Flow Algorithms. PhD thesis, Cornell University (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nandy, S., Carter, L., Ferrante, J. (2004). A-FAST: Autonomous Flow Approach to Scheduling Tasks. In: Bougé, L., Prasanna, V.K. (eds) High Performance Computing - HiPC 2004. HiPC 2004. Lecture Notes in Computer Science, vol 3296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30474-6_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-30474-6_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24129-4
Online ISBN: 978-3-540-30474-6
eBook Packages: Computer ScienceComputer Science (R0)