loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
CycleMeter: Detecting Fraudulent Peers in Internet Cycle Sharing
Tampa, Florida
November 11-November 17
ISBN: 0-7695-2700-0
Zheng Zhang, Purdue University
Y. Charlie Hu, Purdue University
Samuel P. Midkiff, Purdue University
Internet cycle sharing systems that utilize idle computing resources dramatically increase the available resources for high performance computing. Fraudulent resource providers, however, can subvert these systems. While previous research has investigated protection against resource providers that return bad results, we consider a different fraudulent behavior cycle short-changing in which the resource provider faithfully executes the submitted job, but using a smaller percentage of the CPU resources than he/she promises. To detect this short-changing, we propose CycleMeter, a tool that allows a remotely executing application to accurately monitor the percentage of CPU resources it is utilizing throughout its execution period. CycleMeter employs a microbenchmark to measure the instantaneous CPU utilization of the application, and employs a simple and practical mechanism for embedding the microbenchmark into the application. Our experimental results on three operating systems and uniprocessor and multiprocessor machines show that CycleMeter is portable, incurs a low overhead, and is highly effective in detecting a spectrum of cycle shortchanging behavior.
Citation:
Zheng Zhang, Y. Charlie Hu, Samuel P. Midkiff, "CycleMeter: Detecting Fraudulent Peers in Internet Cycle Sharing," sc, pp.32, Proceedings of the 2006 ACM/IEEE conference on Supercomputing, 2006
Usage of this product signifies your acceptance of the Terms of Use.