Demo Data from EDBT 2026 / reviewers in the wild / expert
Srividya Srinivasan
dblp:61/4739
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 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 architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 70% Electronic design automation · 23% Parallel and multicore computing · 7% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
distributed scheduling |
0.0 | 1 | 2002 | Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests · HPDC 2002 |
Distributed systems
grid computing |
0.0 | 1 | 2002 | Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests · HPDC 2002 |
Distributed systems › grid computing
grid scheduling |
0.0 | 1 | 2002 | Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests · HPDC 2002 |
Electronic design automation › high-level synthesis
scheduling |
0.0 | 1 | 2002 | Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests · HPDC 2002 |
Methods — techniques the papers use, named apart from their topics
trace-based simulation · 0.0multiple simultaneous requests · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Selective Buddy Allocation for Scheduling Parallel Jobs on ClustersabstractIn this paper we evaluate the performance implications of using a buddy scheme for contiguous node allocation, in conjunction with a backfilling job scheduler for clusters. When a contiguous node allocation strategy is used, there is a trade-off between improved run-time of jobs (due to reduced link contention and lower communication overhead) and increased wait-time of jobs (due to external fragmentation of the processor system). Using trace-based simulation, a buddy strategy for contiguous node allocation is shown to be unattractive compared to the standard noncontiguous allocation strategy used in all production job schedulers. A simple but effective scheme for selective buddy allocation is then proposed, that is shown to perform better than non-contiguous allocation. Vijay Subramani, Rajkumar Kettimuthu, Srividya Srinivasan, Jeanette Johnston, P. Sadayappan |
CLUSTER | 3 |
| 2002 | Effective Selection of Partition Sizes for Moldable Scheduling of Parallel Jobs
Srividya Srinivasan, Vijay Subramani, Rajkumar Kettimuthu, Praveen Holenarsipur, P. Sadayappan |
HiPC | 1 |
| 2002 | Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous RequestsabstractEven though middleware support for grid computing has been the subject of extensive research, scheduling policies for the grid context have not been much studied. In addition to processor utilization, it is important to consider the response times of jobs in evaluating the performance of grid scheduling strategies. In this paper we propose distributed scheduling algorithms that use multiple simultaneous requests at different sites. Trace-based simulations show that the use of multiple simultaneous requests provides significant performance benefits. We also show how this scheme can be adapted to provide priority to local jobs, without much loss of performance. Vijay Subramani, Rajkumar Kettimuthu, Srividya Srinivasan, P. Sadayappan |
HPDC | 3 |
| 2002 | Selective Preemption Strategies for Parallel Job SchedulingabstractAlthough theoretical results have been established regarding the utility of pre-emptive scheduling in reducing average job turn-around time, job suspension/restart is not much used in practice at supercomputer centers for parallel job scheduling. A number of questions remain unanswered regarding the practical utility of pre-emptive scheduling. We explore this issue through a simulation-based study, using job logs from a supercomputer center We develop a tunable selective-suspension strategy, and demonstrate its effectiveness. We also present new insights into the effect of pre-emptive scheduling on different job classes and address the impact of suspensions on worst-case slowdown. Rajkumar Kettimuthu, Vijay Subramani, Srividya Srinivasan, Thiagaraja Gopalsamy |
ICPP | 3 |
| 2002 | Selective Reservation Strategies for Backfill Job Scheduling
Srividya Srinivasan, Rajkumar Kettimuthu, Vijay Subramani, P. Sadayappan |
JSSPP | 1 |