Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

Dynamic Function Placement for Data-Intensive Cluster Computing

Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior resource availability, and workload mixes. This paper presents ABACUS, a run-time system that monitors and dynamically changes function placement for applications that manipulate large data sets. Several examples of data-intensive workloads are used to show the importance of proper function placement and its dependence on dynamic run-time system behavior, including both long-term variation (e.g., filter selectivity) and short-term variation (e.g., multi-phase applications and inter-application resource contention). Our experiments with ABACUS indicate that it is possible to adapt in all of these situations and that the adaptation converges most quickly in those cases where the performance impact is most significant

Khalil Amiri, CS, Carnegie Mellon University

David Petrou, CS, Carnegie Mellon University

Gregory R. Ganger, CS, Carnegie Mellon University

Garth A. Gibson, CS, Carnegie Mellon University

BibTeX
@inproceedings {271320,
author = {Khalil Amiri and David Petrou and Gregory R. Ganger and Garth A. Gibson},
title = {Dynamic Function Placement for {Data-Intensive} Cluster Computing},
booktitle = {2000 USENIX Annual Technical Conference (USENIX ATC 00)},
year = {2000},
address = {San Diego, CA},
url = {https://www.usenix.org/conference/2000-usenix-annual-technical-conference/dynamic-function-placement-data-intensive-cluster},
publisher = {USENIX Association},
month = jun
}
Download

Links

Paper: 
http://www.usenix.org/publications/library/proceedings/usenix2000/general/full_papers/amiri/amiri.pdf
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us