37 citations · 155 across the 20 of their papers we have counts for
11 papers · 1 filter
Optimal Multi-Level Interval-based Checkpointing for Exascale Stream Processing Systems
Sachini Jayasekara, Aaron Harwood, Shanika Karunasekera
State-of-the-art stream processing platforms make use of checkpointing to support fault tolerance, where a "checkpoint tuple" flows through the topology to all operators, indicatin…
A Utilization Model for Optimization of Checkpoint Intervals in Distributed Stream Processing Systems
Sachini Jayasekara, Aaron Harwood, Shanika Karunasekera
State-of-the-art distributed stream processing systems such as Apache Flink and Storm have recently included checkpointing to provide fault-tolerance for stateful applications. Thi…
An Adaptive Checkpointing Scheme for Peer-to-Peer Based Volunteer Computing Work Flows
Lei Ni, Aaron Harwood
Volunteer Computing, sometimes called Public Resource Computing, is an emerging computational model that is very suitable for work-pooled parallel processing. As more complex grid…
Mean Field Models of Message Throughput in Dynamic Peer-to-Peer Systems
Aaron Harwood, Olga Ohrimenko
The churn rate of a peer-to-peer system places direct limitations on the rate at which messages can be effectively communicated to a group of peers. These limitations are independe…
A Peer-to-Peer Browsable File Index using a Popularity Based Global Namespace
Thomas Jacobs, Aaron Harwood
The distribution of files using decentralized, peer-to-peer (P2P) systems, has significant advantages over centralized approaches. It is however more difficult to settle on the bes…
Towards Parallel Computing on the Internet: Applications, Architectures, Models and Programming Tools
Elankovan Sundararajan, Aaron Harwood
The development of Internet wide resources for general purpose parallel computing poses the challenging task of matching computation and communication complexity. A number of paral…
Lossy Bulk Synchronous Parallel Processing Model for Very Large Scale Grids
Elankovan Sundararajan, Aaron Harwood, Kotagiri Ramamohanarao
The performance of a parallel algorithm in a very large scale grid is significantly influenced by the underlying Internet protocols and inter-connectivity. Many grid programming pl…
A Case for Cooperative and Incentive-Based Coupling of Distributed Clusters
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to man…
SLA-Based Coordinated Superscheduling Scheme and Performance for Computational Grids
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
The Service Level Agreement~(SLA) based grid superscheduling approach promotes coordinated resource sharing. Superscheduling is facilitated between administratively and topological…
Diffusive Load Balancing of Loosely-Synchronous Parallel Programs over Peer-to-Peer Networks
Scott Douglas, Aaron Harwood
The use of under-utilized Internet resources is widely recognized as a viable form of high performance computing. Sustained processing power of roughly 40T FLOPS using 4 million vo…
Analytical formulations of Peer-to-Peer Connection Efficiency
Aaron Harwood
Use of Peer-to-Peer (P2P) service networks introduces a new communication paradigm because peers are both clients and servers and so each peer may provide/request services to/from…