EDBT 2026 Demo / reviewers in the wild / expert
Sridhar Madala
dblp:80/100
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 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
2 papers |
Parallel and multicore computing · 50% Performance modeling and evaluation · 50% |
Topics — the 1 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › parallel algorithms
parallel algorithm analysis |
0.0 | 1 | 1991 | Performance of Synchronous Parallel Algorithms with Regular Structures · IEEE Trans. Parallel Distributed Syst. 1991 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0asymptotic approximation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | Performance of Synchronous Parallel Algorithms with Regular StructuresabstractNew methods are presented for bounding and approximating the mean execution time of partitioning algorithm, and these methods are compared to previous approaches. Distribution-driven and program-driven simulations show that two of the methods are usually accurate to within 10% and give good estimates even when certain independence assumptions are violated. Asymptotic approximations and upper bounds are derived for the average execution time of multiphase algorithms when there is no contention for processes in the parallel phase. In addition, the authors bound the average execution time under static and dynamic scheduling policies and determine the optimum number of parallel tasks to be created to minimize the execution time bounds with constant scheduling overhead.> Sridhar Madala, James B. Sinclair |
IEEE Trans. Parallel Distributed Syst. | 1 |
| 1988 | The Rice Parallel Processing TestbedabstractArticle Free Access Share on The rice parallel processing testbed Authors: R. C. Covington Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile , S. Madala Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile , V. Mehta Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile , J. R. Jump Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile , J. B. Sinclair Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile Authors Info & Claims SIGMETRICS '88: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systemsMay 1988 Pages 4–11https://doi.org/10.1145/55595.55596Online:01 May 1988Publication History 87citation426DownloadsMetricsTotal Citations87Total Downloads426Last 12 Months13Last 6 weeks4 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 Richard Covington, Sridhar Madala, V. Mehta, J. Robert Jump, James B. Sinclair |
SIGMETRICS | 2 |