Scheduling memory constrained jobs on distributed memory parallel computers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
SPICE: Simulated Pore Interactive Computing Environment
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Consensus on transaction commit
ACM Transactions on Database Systems (TODS)
Distributed and collaborative visualization of large data sets using high-speed networks
Future Generation Computer Systems - IGrid 2005: The global lambda integrated facility
Pegasus: A framework for mapping complex scientific workflows onto distributed systems
Scientific Programming
The TeraGyroid experiment -- Supercomputing 2003
Scientific Programming
Co-scheduling with user-settable reservations
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
End-to-end quality of service for high-end applications
Computer Communications
Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities
Combining explicit admission control and congestion control for predictable data transfers in grids
Future Generation Computer Systems
Multi-domain job coscheduling for leadership computing systems
The Journal of Supercomputing
Extending the scope of the controlled logical clock
Cluster Computing
Hi-index | 0.00 |
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 coallocation 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.