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

Jonathan Gluck

dblp:135/4686 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2014
0000-0003-2371-5829ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2

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
Parallel and multicore computing · 61% Distributed systems · 30% Cloud and datacenter computing · 9%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed data processing
0.212013
Hone: "Scaling Down" Hadoop on Shared-Memory Systems · Proc. VLDB Endow. 2013
Parallel and multicore computing › parallel programming runtimes
mapreduce runtime
0.212013
Hone: "Scaling Down" Hadoop on Shared-Memory Systems · Proc. VLDB Endow. 2013
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.012013
Hone: "Scaling Down" Hadoop on Shared-Memory Systems · Proc. VLDB Endow. 2013

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

shared-memory execution · 0.2API compatibility · 0.2
YearPublicationVenuePosition
2014 Optimization Techniques for "Scaling Down" Hadoop on Multi-Core, Shared-Memory Systems
abstract
The underlying assumption behind Hadoop and, more generally, the need for distributed processing is that the data to be analyzed cannot be held in memory on a single machine. Today, this assumption needs to be re-evaluated. Although petabyte-scale datastores are increasingly common, it is unclear whether “typical” analytics tasks require more than a single high-end server. Additionally, we are seeing increased sophistication in analytics, e.g., machine learning, where we process smaller and more refined datasets. To address these trends, we propose “scaling down” Hadoop to run on multi-core, shared-memory machines. This paper presents a prototype runtime called Hone (“Hadoop One”) that is API compatible with Hadoop. With Hone, we can take an existing Hadoop application and run it efficiently on a single server. This allows us to take existing MapReduce algorithms and find the most suitable runtime environment for execution on datasets of varying sizes. For dataset sizes that fit into memory on a single machine, our experiments show that Hone is substantially faster than Hadoop running in pseudo-distributed mode. In some cases, Hone running on a single machine outperforms a 16-node Hadoop cluster.
K. Ashwin Kumar, Jonathan Gluck, Amol Deshpande, Jimmy Lin
EDBT2
2013 Hone: "Scaling Down" Hadoop on Shared-Memory Systems
abstract
The underlying assumption behind Hadoop and, more generally, the need for distributed processing is that the data to be analyzed cannot be held in memory on a single machine. Today, this assumption needs to be re-evaluated. Although petabyte-scale data-stores are increasingly common, it is unclear whether "typical" analytics tasks require more than a single high-end server. Additionally, we are seeing increased sophistication in analytics, e.g., machine learning, which generally operates over smaller and more refined datasets. To address these trends, we propose "scaling down" Hadoop to run on shared-memory machines. This paper presents a prototype runtime called Hone, intended to be both API and binary compatible with standard (distributed) Hadoop. That is, Hone can take an existing Hadoop jar and efficiently execute it, without modification, on a multi-core shared memory machine. This allows us to take existing Hadoop algorithms and find the most suitable run-time environment for execution on datasets of varying sizes. Our experiments show that Hone can be an order of magnitude faster than Hadoop pseudo-distributed mode (PDM); on dataset sizes that fit into memory, Hone can outperform a fully-distributed 15-node Hadoop cluster in some cases as well.
K. Ashwin Kumar, Jonathan Gluck, Amol Deshpande, Jimmy Lin
Proc. VLDB Endow.2