Demo Data from VLDB 2026 / reviewers in the wild / expert
V. A. Signaevskii
dblp:88/6650
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1982
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 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 |
Embedded and real-time systems · 33% Memory systems · 33% Parallel and multicore computing · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › memory management
memory allocation |
0.0 | 1 | 1982 | Comments on "Multiprocessor Scheduling with Memory Allocation - A Deterministic Approach" · IEEE Trans. Computers 1982 |
Embedded and real-time systems › real-time scheduling
multiprocessor scheduling |
0.0 | 1 | 1982 | Comments on "Multiprocessor Scheduling with Memory Allocation - A Deterministic Approach" · IEEE Trans. Computers 1982 |
Parallel and multicore computing › parallel scheduling
schedule length optimization |
0.0 | 1 | 1982 | Comments on "Multiprocessor Scheduling with Memory Allocation - A Deterministic Approach" · IEEE Trans. Computers 1982 |
Methods — techniques the papers use, named apart from their topics
preemptive scheduling · 0.0continuous optimization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1982 | Comments on "Multiprocessor Scheduling with Memory Allocation - A Deterministic Approach"abstractIn the above paper1 the author has investigated a problem of the preemptive scheduling of n independent tasks T = {T1, T2, ···, Tn} on m identical uniprogrammed CPU's P1, P2, ···, Pmwhen a common primary memory of N pages is available. Each task Tiis specified by the virtual time vi and the progress rate pi(si) where si is the number of primary memory pages allotted to Ti. The vector s̄(t) = (S1(t),S2(t),···, Sn(t)) (Si(t)≥0 for 1 ≤ i ≤ n, t ≥ 0; Σi=1 n Si(t) ≤ N for every t; nt0 y pi(si(t))dt = vifor 1 ≤ i ≤ n)[/mi] is determined for which the schedule length y is minimal. The numbers of primary memory pages allotted to tasks are treated as continuous variables. V. A. Signaevskii |
IEEE Trans. Computers | 1 |