Bag-of-Tasks applications scheduling on volunteer desktop grids with adaptive information dissemination

Kwan, Shun Kit; Jogesh, K. Muppala

doi:10.1109/lcn.2010.5735771

Cited by 8 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The tasks travel from the root to the leaves, using decisions taken in each step. The decision could be based on probabilistic models [Kwan and Jogesh 2010] or other factors, such as reputation [Rius et al 2012].…”

Section: Related Workmentioning

confidence: 99%

A volunteer computing system implemented with peer-to-peer communication optimized for small and limited environments

Santiago¹,

Digiampietri²

2018

Anais Do Brazilian E-Science Workshop (BreSci)

View full text Add to dashboard Cite

The computational needs of scientific experiments often require powerful computers. One alternative way to obtain this processing power is taking advantage of the idle processing of personal computers as volunteers. This technique is known as volunteer computing and has great potential in helping scientists. However, there are several issues which can reduce the efficiency of this approach when applied to complex scientific experiments, such as, the ones with long processing time, very large input or output data, etc. In order to face these challenges, we designed a volunteer computing system based on peer-to-peer communication. When compared with the local execution of activities and traditional volunteer computing, the execution time was improved and, in some cases, there was also a reduction of the server upload bandwidth use. Scientific experiments, in several cases, are organized as bag-of-tasks [Kwan and Jogesh 2010] or scientific workflows [Medeiros et al. 1996]. Bag-of-tasks are composed of a set of completely independent tasks, what is very different from workflows where a task needs to wait for the conclusion of another task. Both, typically, require huge computational power and a way to obtain it is the use of several personal computers, for example, desktop grids [Kondo et al. 2007, Anderson 2004] or volunteer computing [Anderson and Fedak 2006]. Volunteer computing (VC) projects take idle resources from donors: the tasks are sent to volunteers (in general using the Internet), and they send the results back to a server. This approach may provide a lot of computational power [Anderson 2004], but in scientific experiments, there are many issues which can turn this approach inefficient, such as long processing tasks [Dethier et al. 2008], great volumes of data to be transferred [Duan et al. 2012] or instability in volunteer computers [Dias et al. 2010]. The majority of these issues are related to the low-speed communication with donors across the Internet. The development of this work was based on an extension [Digiampietri et al. 2014b] of the Workflow Management System (WfMS) called WOODSS (A Spatial Decision Support System based on Workflows) [Seffino et al. 1999], an open source system written in Java extended in this project to deal with P2P communication.

show abstract

Section: Related Workmentioning

confidence: 99%

A volunteer computing system implemented with peer-to-peer communication optimized for small and limited environments

Santiago¹,

Digiampietri²

2018

Anais Do Brazilian E-Science Workshop (BreSci)

View full text Add to dashboard Cite

show abstract

“…In [32], we observed that superpeers could resolve real-world queries with relatively high hit rate under moderate overhead. Advertising cost can be further reduced by advertising only the aggregate information about resources indexed at a superpeer [30], e.g., total number of CPU cores or total processing capacity (measured in FLOPS) of all the peers assigned to a superpeer. Though such aggregated attribute values are acceptable for desktop grids and bag-of-task applications [30], they are too abstract for latency sensitive applications such as CASA, mobile social networks, and P2P clouds where performance is determined by the interactions among dynamic and individual resources.…”

Section: Unstructured-overlay-based Solutionsmentioning

confidence: 99%

“…Gossiping is another form of disseminating resource information in which RSs propagate in the network due to pairwise exchanges of RSs between randomly selected node pairs [30][31]. Multiple concurrent agents are used to speed up the gossiping.…”

Section: Unstructured-overlay-based Solutionsmentioning

confidence: 99%

“…Another alternative is a two-layer overlay (similar to Kazaa [28]) where resource-rich peers, namely superpeers, form a separate overlay while acting as proxies for rest of the peers [20,[30][31]. Each superpeer keeps track of RSs of a subset of peers.…”

Section: Unstructured-overlay-based Solutionsmentioning

confidence: 99%

“…Each superpeer keeps track of RSs of a subset of peers. Superpeers advertise, discover, and/or select resources on behalf of their peers by contacting other superpeers through flooding [20], gossips [30][31], or random walks. This approach enhances multi-attribute query resolution, as superpeers are aware of multiple RSs.…”

Section: Unstructured-overlay-based Solutionsmentioning

confidence: 99%

See 2 more Smart Citations

Collaborative applications over peer-to-peer systems–challenges and solutions

Bandara

Jayasumana

2012

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Emerging collaborative Peer-to-Peer (P2P) systems require discovery and utilization of diverse, multiattribute, distributed, and dynamic groups of resources to achieve greater tasks beyond conventional file and processor cycle sharing. Collaborations involving application specific resources and dynamic quality of service goals are stressing current P2P architectures. Salient features and desirable characteristics of collaborative P2P systems are highlighted. Resource advertising, selecting, matching, and binding, the critical phases in these systems, and their associated challenges are reviewed using examples from distributed collaborative adaptive sensing systems, cloud computing, and mobile social networks. State-of-the-art resource discovery/aggregation solutions are compared with respect to their architecture, lookup overhead, load balancing, etc., to determine their ability to meet the goals and challenges of each critical phase. Incentives, trust, privacy, and security issues are also discussed, as they will ultimately determine the success of a collaborative P2P system. Open issues and research opportunities that are essential to achieve the true potential of collaborative P2P systems are discussed. The final publication is available at www.springerlink.com computing [6], based on underutilized computing resources in homes or businesses for example, targets issues such as centralized data, privacy, proprietary applications, and cascading failures in modern clouds. Certain applications also benefit from a mixture of dedicated and voluntary cloud resources [7][8]. A collaborative P2P system is the core of such a multi-site or community-cloud system that interconnects dedicated/voluntary resources while dealing with rapid scalability and resource fluctuations. We refer to such systems as P2P clouds. Third application, Global Environment for Network Innovations (GENI) [9], is a collaborative and exploratory platform for discoveries and innovation. GENI allows users to aggregate diverse resources (e.g., processing, networks, sensors, actuators, and software) from multiple administrative domains for a common task. A collaborative P2P system is a natural fit for GENI because of its distributed, dynamic, heterogeneous, and collaborative nature. Fourth, the value of social networks can be enhanced by allowing users to share diverse resources available in their mobile devices [2]. For example, a person with a basic mobile phone could connect to a friend's smart phone with GPS capability to locate a nearby ATM. In another example, a group sharing their holiday experiences in a coffee shop could use one member's projection phone to show pictures from others' mobiles/tablets or stream videos from their home servers. Moreover, in large social gatherings such as carnivals, sports events, or political rallies, users' mobile devices can be used to share hot deals, comments, videos, or vote for a certain resolution without relying on a network infrastructure. Such applications are already emerging under the domain of opport...

show abstract

On Sharing Workload in Desktop Grids

Chernov

2018

Communications in Computer and Information Science

View full text Add to dashboard Cite

Bag-of-Tasks applications scheduling on volunteer desktop grids with adaptive information dissemination

Cited by 8 publications

References 31 publications

A volunteer computing system implemented with peer-to-peer communication optimized for small and limited environments

A volunteer computing system implemented with peer-to-peer communication optimized for small and limited environments

Collaborative applications over peer-to-peer systems–challenges and solutions

On Sharing Workload in Desktop Grids

Contact Info

Product

Resources

About