ACM Home Page
Please provide us with feedback. Feedback
CycleMeter: detecting fraudulent peers in internet cycle sharing
Full text HtmlHtml (2 KB),  PdfPdf (268 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 2006 ACM/IEEE conference on Supercomputing table of contents
Tampa, Florida
SESSION: Technical papers table of contents
Article No. 124  
Year of Publication: 2006
ISBN:0-7695-2700-0
Authors
Zheng Zhang  Purdue University, West Lafayette, IN
Y. Charlie Hu  Purdue University, West Lafayette, IN
Samuel P. Midkiff  Purdue University, West Lafayette, IN
Sponsors
IEEE : Institute of Electrical and Electronics Engineers
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1188455.1188584
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
4
 
5
Bailey, D., Barton, J., Lasinski, T., and Simon, H. 1991. The NAS parallel benchmarks. Tech. Rep. TR RNR-91-002, NASA Ames, Aug.
6
7
 
8
 
9
 
10
Butt, A. R., Fang, X., Hu, Y. C., and Midkiff, S. 2004. Java, peer-to-peer, and accountability: Building blocks for distributed cycle sharing. In Proceedings 3rd USENIX Virtual Machine Research and Technology Symposium.
11
12
13
 
14
Eaton, J. W. Gnu octave, http://www.octave.org/.
 
15
Fei, L., Fang, X., Hu, Y. C., and Midkiff, S. P. 2006. Monitoring remotely executing shared memory programs in software DSMs. In Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS).
16
 
17
Gilchrist, J. Parallel bzip2 (pbzip2) data compression software, http://compression.ca/pbzip2/.
 
18
 
19
Jiang, X., and Xu, D. 2004. Collapsar: A VM-based architecture for network attack detention center. In Proceedings of the 13th USENIX Security Symposium (Security '04).
 
20
Johnson, D. B., and Zwaenepoel, W. 1987. Sender-based message logging. In The 7th annual international symposium on fault-tolerant computing (FTCS), IEEE Computer Society.
21
 
22
Lamport, L. 1979. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers C--28, 9 (Sept.), 690--691.
 
23
Lee, S.-I., Johnson, T. A., and Eigenmann, R. 2003. Cetus--an extensible compiler infrastructure for source-to-source transformation. In Proceedings of the 16th International Workshop on Languages and Compilers for Parallel Computing (LCPC).
24
 
25
Lo, V., Zhou, D., Zappala, D., Liu, Y., and Zhao. S. 2004. Cluster computing on the fly: P2P scheduling of idle cycles in the internet. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS).
 
26
Loureiro, S., Bussard, L., and Roudier, Y. 2002. Extending tamper-proof hardware security to untrusted execution environments. In Proceeding of the Fifth Smart Card Research and Advanced Application Conference (CARDIS'02), USENIXIFIP.
 
27
Meadows, C. 1997. Detecting attacks on mobile agents. In Foundations for Secure Mobile Code Workshop, 64--65.
 
28
Parzen, E. 1962. On estimation of a probability density function and mode. Ann. Math. Stat. 33, 1065--1076.
 
29
 
30
 
31
Sander, T., and Tschudin, C. F. 1998. Towards mobile cryptography. In Proceedings of the IEEE Symposium on Security and Privacy.
 
32
Saroiu, S., Gummadi, P. K., and Gribble, S. D. 2002. A measurement study of peer-to-peer fi le sharing systems. In Proceedings of Multimedia Computing and Networking (MMCN).
 
33
Simplescalar LLC. Simplescalar, http://www.simplescalar.com/.
 
34
35
 
36
Yang, S., Butt, A. R., Hu. Y. C., and Midkiff, S. P. 2005. Lightweight monitoring of the progress of remotely executing computations. In Proceedings of the 18th International Workshop on Languages and Compilers for Parallel Computing (LCPC).
37
 
38
Yee, B. 1994. Using secure coprocessors. PhD thesis, Carnegie Mellon University.
 
39
 
40
Zhao, S., Zhou, D., Liu, Y., Lo, V., and Zappala, D. 2004. Result verification in open peer-to-peer cycle sharing systems. In submitted to Sigcomm'04 Poster Session.
 
41
 
42
Zoraja, I., Rackl, G., and Ludwig, T. 1999. Towards monitoring in parallel and distributed environments. In International Conference on Software in Telecommunications and Computer Networks SoftCOM '99, 133--141.

Collaborative Colleagues:
Zheng Zhang: colleagues
Y. Charlie Hu: colleagues
Samuel P. Midkiff: colleagues