skip to main content
10.1145/1188455.1188584acmconferencesArticle/Chapter ViewAbstractPublication PagesscConference Proceedingsconference-collections
Article

CycleMeter: detecting fraudulent peers in internet cycle sharing

Published: 11 November 2006 Publication History

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

[1]
Amza, C., Cox, A., Dwarkadas, S., Keleher, P., Lu, H., Rajamony, R., Yu, W., and Zwaenepoel, W. 1996. Tread-Marks: Shared memory computing on networks of workstations. IEEE Computer 29, 2 (Feb.), 18--28.]]
[2]
Anderson, D. P. 2004. BOINC: A system for public-resource computing and storage. In Proc. 5th IEEE/ACM International Workshop on Grid Computing.]]
[3]
Andrade, N., Brasileiro, F., Cime, W., and Mowbray, M. 2004. Discouraging free riding in a peer-to-peer CPU-sharing grid. In Proceedings of the 13th IEEE International Symposium on High performance Distributed Computing (HPDC).]]
[4]
Arnold, M., and Ryder, B. G. 2001. A framework for reducing the cost of instrumented code. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI), ACM.]]
[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]
Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., Neugebauer, R., Pratt, I., and Warfield, A. 2003. Xen and the art of virtualization. In Proc. 19th ACM Symposium on Operating Systems Principles (SOSP).]]
[7]
Bianchini, R., Kontothanassis, L. I., Pinto, R., De Maria, M., Abud, M., and Amorim, C. L. 1996. Hiding communication latency and coherence overhead in software dsms. In Proceedings of the seventh international conference on Architectural support for programming languages and operating systems, ACM Press, 198-209.]]
[8]
Bierman, E., and Cloete, E. 2002. Classification of malicious host threats in mobile agent computing. In Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology, South African Institute for Computer Scientists and Information Technologists, 141--148.]]
[9]
Butt, A. R., Zhang, R., and Hu, Y. C. 2003. A self-organizing fbck of Condors. In Proccedings of Supercomputing.]]
[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]
Carter, J., Bennett, J., and Zwaenepoel, W. 1991. Implementation and performance of Munin. In Proceedings of the 13th ACM Symposium on Operating Systems Principles, 152--164.]]
[12]
Collberg, C., Carter, E., Debray, S., Huntwork, A., Linn, C., and Stepp, M. 2004. Dynamic path-based software watermarking. In Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation (PLDI), ACM.]]
[13]
Cox, L. P., and Noble, B. D. 2003. Samsara: Honor among thieves in peer-to-peer storage. In Proc. 19th ACM Symposium on Operating Systems Principles (SOSP).]]
[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]
Gharachorloo, K., Lenoski, D., Laudon, J., Gibbons, P., Gupta, A., and Hennessy, J. 1990. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proceedings of the 17th Annual International Symposium on Computer Architecture, 15--26.]]
[17]
Gilchrist, J. Parallel bzip2 (pbzip2) data compression software, http://compression.ca/pbzip2/.]]
[18]
Hu, Y. C., Cox, A., and Zwaenepoel, W. 2000. Improving fine-grained rrregular shared-memory benchmarks by data reordering. In Proceedings of IEEE/ACM SC'2000.]]
[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]
Keleher, P., Cox, A. L., and Zwaenepoel, W. 1992. Lazy release consistency for software distributed shared memory. In Proceedings of the 19th Annual International Symposium on Computer Architecture, 13--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]
Li, K., and Hudak, P. 1989. Memory coherence in shared virtual memory systems. ACM Transactions on Computer Systems 7, 4 (Nov.), 321--359.]]
[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]
Regehr, J. 2002. Inferring scheduling behavior with hourglass. In In Proceedings of the USENIX Annual Technical Conference (FREENIX Track).]]
[30]
Sander, T., and Tschudin, C. F. 1998. Protecting mobile agents against malicious hosts. In Mobile Agents and Security, Springer-Verlag, 44--60.]]
[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]
Singh, J., Weber, W.-D., and Gupta, A. 1991. SPLASH: Stanford parallel applications for shared-memory. Tech. Rep CSL-TR-91-469, Stanford University, Apr.]]
[35]
Wasserman, H., and Blum, M. 1997. Software reliability via run-time result-checking. Journal of the ACM (JACM) 44, 6, 826--849.]]
[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]
Yang, S., Butt, A. R., Hu, Y. C., and Midkiff, S. 2005. Trust but verify: Monitoring remotely executing programs for progress and correctness. In Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP).]]
[38]
Yee, B. 1994. Using secure coprocessors. PhD thesis, Carnegie Mellon University.]]
[39]
Yee, B. S. 1999. A sanctuary for mobile agents. In Secure Internet Programming, 261--273.]]
[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]
Zhou, D., and Lo, V. 2004. Cluster computing on the fly: Resource discovery in a cycle sharing peer-to-peer system. In GP2PC Workshop, CCGrid'04.]]
[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.]]

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SC '06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing
November 2006
746 pages
ISBN:0769527000
DOI:10.1145/1188455
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 November 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. benchmarking
  2. monitoring
  3. operating systems
  4. peer-to-Peer

Qualifiers

  • Article

Conference

SC '06
Sponsor:

Acceptance Rates

SC '06 Paper Acceptance Rate 54 of 239 submissions, 23%;
Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 203
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media