Demo Data from VLDB 2026 / reviewers in the wild / expert
Noubar Partamian
dblp:01/4729
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1995
—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.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Processor architecture and microarchitecture · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
instruction scheduling |
0.0 | 1 | 1995 | Modulo scheduling with multiple initiation intervals · MICRO 1995 |
Compilers and program optimization › instruction scheduling › software pipelining
modulo scheduling |
0.0 | 1 | 1995 | Modulo scheduling with multiple initiation intervals · MICRO 1995 |
Compilers and program optimization › instruction scheduling
software pipelining |
0.0 | 1 | 1995 | Modulo scheduling with multiple initiation intervals · MICRO 1995 |
Processor architecture and microarchitecture › instruction-level parallelism
predicated execution |
0.0 | 1 | 1995 | Modulo scheduling with multiple initiation intervals · MICRO 1995 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Modulo scheduling with multiple initiation intervalsabstractModulo scheduling is a well defined local scheduling based software pipelining technique. One disadvantage of traditional modulo scheduling is that it has a single initiation interval (II) for loops with multiple execution paths. Thus, shorter or more frequently executed paths will be penalized by longer or less frequently executed paths. Furthermore, for architectures with predicated execution, this single-II must be large enough to satisfy the resource and recurrence requirements of all operations from all execution paths rather than the requirements of the most constrained path. In this paper, a multiple-II modulo scheduling technique is proposed for architectures with predicated execution. This enhancement to modulo scheduling maintains the benefits of a local scheduling based approach while reducing the effective II. Nancy J. Warter-Perez, Noubar Partamian |
MICRO | 2 |