Rescheduling and checkpointing as strategies to run synchronous parallel programs on P2P desktop grids

Abstract

Today, BSP (Bulk-Synchronous Parallel) represents one of the most often used models for writing tightly-coupled parallel programs. As resource substrates, commonly clusters and eventually computational grids are used to run BSP applications. In this context, here we investigate the use of collaborative computing and idle resources to execute this kind of demand, so we are proposing a model named BSPonP2P to answer the following question: How can we develop an e cient and viable model to run BSP applications on P2P Desktop Grids? We answer it by providing both process rescheduling and checkpointing to deal with dynamism at application and infrastructure levels and resource heterogeneity. The results concern a prototype that ran over a subset of the Grid5000, showing encouraging results on using collaboration and volatile resources for HPC.

Strategies for Big Data Analytics through Lambda Architectures in Volatile Environments

“…It is the main goal of this paper to overcome existing issues of the Global Dispatcher (GD) regarding data distribution in real time applications, via solutions presented by Righi et al (2015). This means that the Global Dispatcher will carry out the tasks of load balancing, and latency control (data stream processing and network bandwidth), provision of scalability, while reducing the costs for improvement of availability of resources.…”