Personal volunteer computing

Lavoie, Erick; Hendren, Laurie

doi:10.1145/3310273.3322819

Cited by 26 publications

(21 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, Pando offers a platform in which a user must install a server and run it in his own machine. Then, other users may access this back-end application with their browsers to offer it for computing [5]. On the other hand, it has been proposed to use the browser as a distributed platform for content delivery [6][9].…”

Section: Related Workmentioning

confidence: 99%

An Approach to Build P2P Web Extensions

Gonzalez

Firmenich

Fernández

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Web extensions are currently the most frequently used mechanism for end-users to externally adapt and enrich the web. While most functionality offered by extensions runs on the browser, extensions that offer collaboration, complex computation, or massive storage rely on a centralized server. Relying on a server increases the cost of building, deploying, and maintaining web extensions (even small ones). This paper presents a novel P2P approach to build web extensions. It removes the need for a centralized server while hiding behind a framework the complexity of building P2P extensions. It uses a middleware to manage the resources offered by the browser so multiple P2P extensions can coexist, without degrading the browser's performance. This paper discusses the main challenges of building P2P web extensions, presents the approach, and shows its potential with a proof of concept.

show abstract

Section: Related Workmentioning

confidence: 99%

An Approach to Build P2P Web Extensions

Gonzalez

Firmenich

Fernández

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…However, the administrative complexity (obtaining necessary authorizations) allowing the public to access a HPC Grid is a real barrier for academics and small businesses. [25].…”

Section: Hpc Gridmentioning

confidence: 99%

“…If their owners are willing to actively lend CPU time and memory, these devices can be used as distributed computing infrastructure at no cost. This is called a Volunteer Computing (VC) system [24], [25], [26], [27]. A HPC Volunteer Computing system is obtained through community engagement by setting up a system of volunteer machines.…”

Section: Introductionmentioning

confidence: 99%

High Performance Computing in Resource Poor Settings: An Approach based on Volunteer Computing

Hamza¹,

Jiomekong²

2020

IJACSA

View full text Add to dashboard Cite

High Performance Computing (HPC) systems aim to solve complex computing problems (in a short amount of time) that are either too large for standard computers or would take too long. They are used to solve computational problems in many fields such as medical science (for drug discovery, breast cancer detection in images, etc.), climate science, physics, mathematical science, etc. Existing solutions such as HPC Supercomputer, HPC Cluster, HPC Cloud or HPC Grid are not adapted for resource poor settings (mainly for developing countries) because their fees are generally beyond the funding (particularly for academics) and the administrative complexity to access to HPC Grid creates a higher barrier. This paper presents an approach allowing to build a Volunteer Computing system for HPC in resource poor settings. This solution does not require any additional investment in hardware, but relies instead on voluntary machines already owned by the private users. The experiment has been made on the mathematical problem of solving the matrices multiplication using Volunteer Computing system. Given the success of this experiment, the enrollment of other volunteers has already started. The goal being to create a powerful Volunteer Computing system with the maximum number of computers.

show abstract

“…We implemented a scalable version of Pando [29], a tool that leverages personal devices' browsers for executing computations in parallel, based on our JavaScript implementation [26] of the Genet fat-tree overlay. When a new browser window, executing on the device, successfully connects, it first joins as a leaf in the fat-tree and computes results, therefore acting as a processor.…”

Section: Application To Personal Volunteer Computingmentioning

confidence: 99%

“…Typical applications of volunteer computing have different data transfer patterns because each participant receives a different sub-set of data. BOINC submits the same computation to a small number of participants (at least three) until a majority agrees [41], while the current version of Pando [29] does not use redundancy because the code is executed on trusted devices. In addition, in both cases, each participant will return different results to the root.…”

Section: Related Workmentioning

confidence: 99%

Genet: A Quickly Scalable Fat-Tree Overlay for Personal Volunteer Computing using WebRTC

Lavoie

Hendren

Desprez³

et al. 2019

2019 IEEE 13th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)

Self Cite

View full text Add to dashboard Cite

WebRTC enables browsers to exchange data directly but the number of possible concurrent connections to a single source is limited. We overcome the limitation by organizing participants in a fat-tree overlay: when the maximum number of connections of a tree node is reached, the new participants connect to the node's children. Our design quickly scales when a large number of participants join in a short amount of time, by relying on a novel scheme that only requires local information to route connection messages: the destination is derived from the hash value of the combined identifiers of the message's source and of the node that is holding the message. The scheme provides deterministic routing of a sequence of connection messages from a single source and probabilistic balancing of newer connections among the leaves. We show that this design puts at least 83% of nodes at the same depth as a deterministic algorithm, can connect a thousand browser windows in 21-55 seconds in a local network, and can be deployed for volunteer computing to tap into 320 cores in less than 30 seconds on a local network to increase the total throughput on the Collatz application by two orders of magnitude compared to a single core.

show abstract

Personal volunteer computing

Cited by 26 publications

References 21 publications

An Approach to Build P2P Web Extensions

An Approach to Build P2P Web Extensions

High Performance Computing in Resource Poor Settings: An Approach based on Volunteer Computing

Genet: A Quickly Scalable Fat-Tree Overlay for Personal Volunteer Computing using WebRTC

Contact Info

Product

Resources

About