Abstract
HARC—the Highly-Available Resource Co-allocator—is an open-source system for reserving multiple resources in a coordinated fashion. HARC can handle different types of resource, and has been used to reserve time on supercomputers across a US-wide testbed, together with dedicated lightpaths connecting the machines. At HARC’s core are a distributed set of processes called Acceptors, which provide a co-allocation service. HARC functions normally provided a majority of the Acceptors are working; this replication gives HARC its high availability. The Paxos Commit protocol ensures that consistency across all Acceptors is maintained. This paper gives an overview of HARC, and explains both how it works and how it is used. We show that HARC’s design makes it easy for the community to contribute new components for co-allocating different types of resource, while the stability of the overall system is maintained.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blake, R.J., Coveney, P.V., Clarke, P., Pickles, S.M.: The teragyroid experiment–supercomputing 2003. Scientific Computing 13(1), 1–17 (2005)
Deelman, E., Singh, G., Su, M.-H., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Vahi, K., Berriman, G.B., Good, J., Laity, A., Jacob, J.C., Katz, D.S.: Pegasus: a framework for mapping complex scientific workflows onto distributed systems. Scientific Programming 13(3), 219–237 (2005)
EnLIGHTened Computing: Highly-dynamic Applications Driving Adaptive Grid Resources, http://www.enlightenedcomputing.org
Foster, I., Fidler, M., Roy, A., et al.: End-to-End Quality of Service for High-end Applications. Computer Communications 27(14), 1375–1388 (2004), http://www.globus.org/alliance/publications/papers/e2e.pdf
Foster, I., Kesselman, C., Lee, C., Lindell, R., Nahrstedt, K., Roy, A.: A distributed resource management architecture that supports advance reservations and co-allocation. In: IWQoS 1999. The Seventh IEEE/IFIP International Workshop on Quality of Service, pp. 27–36. IEEE Computer Society Press, Los Alamitos (1999)
Globus toolkit, http://www.globus.org/toolkit/
Gray, J., Lamport, L.: Consensus on transaction commit. Technical Report MSR-TR-2003-96, Microsoft Research (January 2004), http://research.microsoft.com/research/pubs/view.aspx?tr_id=701
Gray, J., Lamport, L.: Consensus on transaction commit. ACM TODS 31(1), 130–160 (2006)
Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1992)
HARC: The Highly-Available Resource Co-allocator, http://www.cct.lsu.edu/~maclaren/HARC
Hutanu, A., Allen, G., et al.: Distributed and collaborative visualization of large data sets using high-speed networks. Future Generation Computer Systems. The International Journal of Grid Computing: Theory, Methods and Applications 22(8), 1004–1010 (2006)
Jha, S., Harvey, M.J., et al.: Spice: Simulated pore interactive computing environment - using grid computing to understand dna translocation across protein nanopores embedded in lipid membranes. In: UK e-Science All Hands Meeting (2005), http://www.allhands.org.uk/2005/proceedings
Lamport, L.: Paxos Made Simple. In ACM SIGACT news distributed computing column 5. SIGACT News 32(4), 18–25 (2001), http://research.microsoft.com/users/lamport/pubs/paxos-simple.pdf
Lampson, B.W., Sturgis, H.E.: Crash recovery in a distributed data storage system. Technical Report (unpublished), Xerox Palo Alto Research Center (1976) (1979), http://research.microsoft.com/Lampson/21-CrashRecovery/Acrobat.pdf
The Louisiana Optical Network Initiative (LONI), http://www.loni.org/
MacLaren, J.: Co-allocation of Compute and Network resources using HARC. In: Proceedings of Lighting the Blue Touchpaper for UK e-Science: Closing Conference of the ESLEA Project. PoS(ESLEA)016 (2007), http://pos.sissa.it/archive/conferences/041/016/ESLEA_016.pdf
Mannie, E.: Generalized Multi-Protocol Label Switching (GMPLS) Architecture. RFC 3945, The Internet Engineering Task Force (IETF) (October 2004), http://www.ietf.org/rfc/rfc3945.txt
McCann, C., Zahorjan, J.: Scheduling Memory Constrained Jobs on Distributed Memory Parallel Computers. In: Proceedings of ACM SIGMETRICS 1995/PERFORMANCE 1995 Joint International Conference on Measurement and Modeling of Computer Systems, pp. 208–219 (May 1995)
Beginners Guide to TL1, http://netcoolusers.org/TL1/Beginners_Guide_to_TL1
Tuecke, S., Welch, V., et al.: Internet X.509 Public Key Infrastructure (PKI) Proxy Certificate Profile. RFC 3820, Internet Engineering Task Force (June 2004), http://www.ietf.org/rfc/rfc3820.txt
Yoshimoto, K., Kovatch, P.A., Andrews, P.: Co-scheduling with user-settable reservations. In: Feitelson, D.G., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 146–156. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
MacLaren, J. (2007). HARC: The Highly-Available Resource Co-allocator. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS. OTM 2007. Lecture Notes in Computer Science, vol 4804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76843-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-76843-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76835-7
Online ISBN: 978-3-540-76843-2
eBook Packages: Computer ScienceComputer Science (R0)