A market-based scheduler for JXTA-based peer-to-peer computing system

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Peer-to-Peer (P2P) computing is said to be the next wave of computing after client-server and web-based computing. It provides an opportunity to harness a lot of idle peer-resources such as desktop computers across the Internet, for solving large-scale computing applications. Each peer is autonomous and it needs incentive for sustained contribution of its resources to P2P applications. In addition, a flexible and efficient job scheduling is needed to harvest the idle computing power as cheaply and economically as possible. This paper introduces an economic based job scheduler for mapping jobs to resources in P2P computing environment. The scheduler has been implemented with the Compute Power Market (CPM) system developed using Sun JXTA P2P technology. Our scheduler can be configured depending on users' quality of service requirements such as the deadline and budget constraints. Our scheduler follows a hierarchy scheme. The design allows multiple consumers and multiple providers to schedule and run jobs. To allow wider support for a wide variety of applications, the system is designed to allow easy 'plug in' of user applications. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Ping, T. T., Sodhy, G. C., Yong, C. H., Haron, F., & Buyya, R. (2004). A market-based scheduler for JXTA-based peer-to-peer computing system. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3046 LNCS(PART 4), 147–157. https://doi.org/10.1007/978-3-540-24768-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free