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

Harimath Sivakumar

dblp:37/4695 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Systems, architecture and hardware · 3 · 1 first-author

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 networks
1 paper
Transport protocols and congestion control · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 50% High-performance computing · 35% Cloud and datacenter computing · 15%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › multipath transport
network striping
0.012000
PSockets: The Case for Application-level Network Striping for Data Intensive Applications using High Speed Wide Area Networks · SC 2000
Transport protocols and congestion control
TCP performance
0.012000
PSockets: The Case for Application-level Network Striping for Data Intensive Applications using High Speed Wide Area Networks · SC 2000
Data mining › big data analytics › large-scale data mining
distributed data mining
0.011999
Papyrus: A System for Data Mining over Local and Wide Area Clusters and Super-Clusters · SC 1999
Distributed systems
distributed data processing
0.011999
Papyrus: A System for Data Mining over Local and Wide Area Clusters and Super-Clusters · SC 1999
High-performance computing
data-intensive computing
0.012000
PSockets: The Case for Application-level Network Striping for Data Intensive Applications using High Speed Wide Area Networks · SC 2000
High-performance computing › data transfer
wide-area data transfer
0.012000
PSockets: The Case for Application-level Network Striping for Data Intensive Applications using High Speed Wide Area Networks · SC 2000
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.011999
Papyrus: A System for Data Mining over Local and Wide Area Clusters and Super-Clusters · SC 1999

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

parallel sockets · 0.1network striping · 0.1distributed data mining · 0.0
YearPublicationVenuePosition
2005 Simple Available Bandwidth Utilization Library for High-Speed Wide Area Networks
Robert L. Grossman, Marco Mazzucco, Harimath Sivakumar, Y. Pan
J. Supercomput.3
2000 PSockets: The Case for Application-level Network Striping for Data Intensive Applications using High Speed Wide Area Networks
abstract
Transmission Control Protocol (TCP) is used by various applications to achieve reliable data transfer. TCP was originally designed for unreliable networks. With the emergence of high-speed wide area networks various improvements have been applied to TCP to reduce latency and achieve improved bandwidth. The improvement is achieved by having system administrators tune the network and can take a considerable amount of time. This paper introduces PSockets (Parallel Sockets), a library that achieves an equivalent performance without manual tuning. The basic idea behind PSockets is to exploit network striping. By network striping we mean striping partitioned data across several open sockets. We describe experimental studies using PSockets over the Abilene network. We show in particular that network striping using PSockets is effective for high performance data intensive computing applications using geographically distributed data.
Harimath Sivakumar, Stuart Bailey, Robert L. Grossman
SC1
1999 Papyrus: A System for Data Mining over Local and Wide Area Clusters and Super-Clusters
abstract
Article Free Access Share on Papyrus: a system for data mining over local and wide area clusters and super-clusters Authors: S. Bailey National Center for Data Mining, University of Illinois at Chicago National Center for Data Mining, University of Illinois at ChicagoView Profile , R. Grossman National Center for Data Mining, University of Illinois at Chicago and Magnify, Inc. National Center for Data Mining, University of Illinois at Chicago and Magnify, Inc.View Profile , H. Sivakumar National Center for Data Mining, University of Illinois at Chicago National Center for Data Mining, University of Illinois at ChicagoView Profile , A. Turinsky National Center for Data Mining, University of Illinois at Chicago National Center for Data Mining, University of Illinois at ChicagoView Profile Authors Info & Claims SC '99: Proceedings of the 1999 ACM/IEEE conference on SupercomputingJanuary 1999 Pages 63–eshttps://doi.org/10.1145/331532.331595Online:01 January 1999Publication History 44citation676DownloadsMetricsTotal Citations44Total Downloads676Last 12 Months7Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Stuart Bailey, Robert L. Grossman, Harimath Sivakumar, Andrei L. Turinsky
SC3