Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mathew Ryden

dblp:149/7598 · also Matthew Ryden · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 62% Distributed systems · 38%
Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing
edge cloud
0.312017
Nebula: Distributed Edge Cloud for Data Intensive Computing · IEEE Trans. Parallel Distributed Syst. 2017
Cloud and datacenter computing
cluster resource management and scheduling
0.312017
Nebula: Distributed Edge Cloud for Data Intensive Computing · IEEE Trans. Parallel Distributed Syst. 2017
Distributed systems
fault tolerance
0.112017
Nebula: Distributed Edge Cloud for Data Intensive Computing · IEEE Trans. Parallel Distributed Syst. 2017
Distributed systems › replication › replication and fault tolerance
replication and recovery
0.112017
Nebula: Distributed Edge Cloud for Data Intensive Computing · IEEE Trans. Parallel Distributed Syst. 2017

Methods — techniques the papers use, named apart from their topics

mapreduce · 0.6
YearPublicationVenuePosition
2017 Nebula: Distributed Edge Cloud for Data Intensive Computing
abstract
Centralized cloud infrastructures have become the popular platforms for data-intensive computing today. However, they suffer from inefficient data mobility due to the centralization of cloud resources, and hence, are highly unsuited for geo-distributed data-intensive applications where the data may be spread at multiple geographical locations. In this paper, we present Nebula: a dispersed edge cloud infrastructure that explores the use of voluntary resources for both computation and data storage. We describe the lightweight Nebula architecture that enables distributed data-intensive computing through a number of optimization techniques including location-aware data and computation placement, replication, and recovery. We evaluate Nebula performance on an emulated volunteer platform that spans over 50 PlanetLab nodes distributed across Europe, and show how a common data-intensive computing framework, MapReduce, can be easily deployed and run on Nebula. We show Nebula MapReduce is robust to a wide array of failures and substantially outperforms other wide-area versions based on emulated existing systems.
Albert Jonathan, Mathew Ryden, Kwangsung Oh, Abhishek Chandra, Jon B. Weissman
IEEE Trans. Parallel Distributed Syst.2
2014 Nebula: Distributed Edge Cloud for Data Intensive Computing
abstract
Centralized cloud infrastructures have become the de-facto platform for data-intensive computing today. However, they suffer from inefficient data mobility due to the centralization of cloud resources, and hence, are highly unsuited for dispersed-data-intensive applications, where the data may be spread at multiple geographical locations. In this paper, we present Nebula: a dispersed cloud infrastructure that uses voluntary edge resources for both computation and data storage. We describe the lightweight Nebula architecture that enables distributed data-intensive computing through a number of optimizations including location-aware data and computation placement, replication, and recovery. We evaluate Nebula's performance on an emulated volunteer platform that spans over 50 PlanetLab nodes distributed across Europe, and show how a common data-intensive computing framework, MapReduce, can be easily deployed and run on Nebula. We show Nebula MapReduce is robust to a wide array of failures and substantially outperforms other wide-area versions based on a BOINC like model.
Mathew Ryden, Kwangsung Oh, Abhishek Chandra, Jon B. Weissman
IC2E1