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

Ruchir Shah

dblp:31/1429 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2022
0009-0009-0793-7203ORCID · reported

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

Systems, architecture and hardware · 2 · 2 first-authorComputer networks · 1 · 1 since 2021

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
Internet of things and sensor networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 61% Parallel and multicore computing · 39%

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

TopicWeightPapersLastEvidence papers
Distributed systems
grid computing
0.112007
On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments · IEEE Trans. Parallel Distributed Syst. 2007
Distributed systems › distributed scheduling › load sharing
job migration
0.112007
On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments · IEEE Trans. Parallel Distributed Syst. 2007
Parallel and multicore computing
load balancing
0.112007
On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments · IEEE Trans. Parallel Distributed Syst. 2007
Parallel and multicore computing › load balancing
load prediction
0.012007
On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments · IEEE Trans. Parallel Distributed Syst. 2007

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

battery voltage perturbation · 0.6load estimation · 0.1MELISA · 0.1LBA · 0.1
YearPublicationVenuePosition
2022 RetroIoT: retrofitting internet of things deployments by hiding data in battery readings
abstract
Commercial Internet of Things (IoT) deployments are mostly closed-source systems that offer little to no flexibility to modify the hardware and software of the end devices. Once deployed, retrofitting such systems to an upgraded functionality requires replacing all the devices, which can be extremely time and cost prohibitive. End users cannot generally leverage deployed infrastructure to add their own sensors or custom data. However, we observe that IoT systems sometimes report battery voltage information to the cloud, and batteries are often user-serviceable. This indicates that perturbing the battery voltage to encode customized information could be a minimally invasive method to retrofit existing IoT devices.
Victor Ariel Leal Sobral, Nurani Saoda, Ruchir Shah, Wenpeng Wang, Bradford Campbell
MobiCom3
2007 On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments
abstract
In this paper, we address several issues that are imperative to grid environments such as handling resource heterogeneity and sharing, communication latency, job migration from one site to other, and load balancing. We address these issues by proposing two job migration algorithms, which are MELISA (modified ELISA) and LBA (load balancing on arrival). The algorithms differ in the way load balancing is carried out and is shown to be efficient in minimizing the response time on large and small-scale heterogeneous grid environments, respectively. MELISA, which is applicable to large-scale systems (that is, interGrid), is a modified version of ELISA in which we consider the job migration cost, resource heterogeneity, and network heterogeneity when load balancing is considered. The LBA algorithm, which is applicable to small-scale systems (that is, intraGrid), performs load balancing by estimating the expected finish time of a job on buddy processors on each job arrival. Both algorithms estimate system parameters such as the job arrival rate, CPU processing rate, and load on the processor and balance the load by migrating jobs to buddy processors by taking into account the job transfer cost, resource heterogeneity, and network heterogeneity. We quantify the performance of our algorithms using several influencing parameters such as the job size, data transfer rate, status exchange period, and migration limit, and we discuss the implications of the performance and choice of our approaches.
Ruchir Shah, Bharadwaj Veeravalli, Manoj Misra
IEEE Trans. Parallel Distributed Syst.1
2006 Estimation Based Load Balancing Algorithm for Data-Intensive Heterogeneous Grid Environments
Ruchir Shah, Bharadwaj Veeravalli, Manoj Misra
HiPC1