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

Dhiraj Sehgal

dblp:12/10441 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—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
Parallel and multicore computing · 44% Memory systems · 44% Interconnection networks and networks-on-chip · 13%

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

TopicWeightPapersLastEvidence papers
Memory systems
data movement
0.112011
Hadoop acceleration through network levitated merge · SC 2011
Parallel and multicore computing › data-parallel programming
mapreduce
0.112011
Hadoop acceleration through network levitated merge · SC 2011
Interconnection networks and networks-on-chip
high-speed interconnect
0.012011
Hadoop acceleration through network levitated merge · SC 2011

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

pipelining · 0.1
YearPublicationVenuePosition
2011 Hadoop acceleration through network levitated merge
abstract
Hadoop is a popular open-source implementation of the MapReduce programming model for cloud computing. However, it faces a number of issues to achieve the best performance from the underlying system. These include a serialization barrier that delays the reduce phase, repetitive merges and disk access, and lack of capability to leverage latest high speed interconnects. We describe Hadoop-A, an acceleration framework that optimizes Hadoop with plugin components implemented in C++ for fast data movement, overcoming its existing limitations. A novel network-levitated merge algorithm is introduced to merge data without repetition and disk access. In addition, a full pipeline is designed to overlap the shuffle, merge and reduce phases. Our experimental results show that Hadoop-A doubles the data processing throughput of Hadoop, and reduces CPU utilization by more than 36%.
Yandong Wang 0001, Xinyu Que, Weikuan Yu, Dror Goldenberg, Dhiraj Sehgal
SC5