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

Java, Peer-to-Peer, and Accountability: Building Blocks for Distributed Cycle Sharing

The increased popularity of grid systems and cycle sharing across organizations leads to the need for scalable systems that provide facilities to locate resources, to be fair in the use of those resources, and to allow untrusted applications to be safely executed using those resources. This paper describes a prototype of such a system, where a peer-to-peer (p2p) network is used to locate and allocate resources; a Java Virtual Machine is used to allow applications to be safely hosted, and for their progress to be monitored by the submitter; and a novel distributed credit system supports accountability among providers and consumers of resources to use the system fairly. We provide experimental data showing that cheaters are quickly identified and purged from the system, and that the overhead of monitoring jobs is effectively zero.

Ali Raza Butt, Purdue University

Xing Fang, Purdue University

Y. Charlie Hu, Purdue University

Samuel Midkiff, Purdue University

BibTeX
@inproceedings {269947,
author = {Ali Raza Butt and Xing Fang and Y. Charlie Hu and Samuel Midkiff},
title = {Java, {Peer-to-Peer}, and Accountability: Building Blocks for Distributed Cycle Sharing},
booktitle = {3rd Virtual Machine Research \& Technology Symposium (VM 04)},
year = {2004},
address = {San Jose, CA},
url = {https://www.usenix.org/conference/vm-04/java-peer-peer-and-accountability-building-blocks-distributed-cycle-sharing},
publisher = {USENIX Association},
month = may
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/vm04/tech/full_papers/butt/butt.pdf
Paper (HTML): 
http://usenix.org/publications/library/proceedings/vm04/tech/full_papers/butt/butt_html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us