Demo Data from EDBT 2026 / reviewers in the wild / expert
Gerald G. Monforton
dblp:88/3987
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1993
—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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 87% Distributed systems · 13% | |
| Theoretical computer science
1 paper |
Approximation and online algorithms · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › task allocation
static task assignment |
0.0 | 1 | 1993 | Fast Allocation of Processes in Distributed and Parallel Systems · IEEE Trans. Parallel Distributed Syst. 1993 |
Parallel and multicore computing
task allocation |
0.0 | 1 | 1993 | Fast Allocation of Processes in Distributed and Parallel Systems · IEEE Trans. Parallel Distributed Syst. 1993 |
Approximation and online algorithms
bin packing |
0.0 | 1 | 1993 | Fast Allocation of Processes in Distributed and Parallel Systems · IEEE Trans. Parallel Distributed Syst. 1993 |
Methods — techniques the papers use, named apart from their topics
heuristic search · 0.0MULTIFIT bin-packing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Fast Allocation of Processes in Distributed and Parallel SystemsabstractMULTIFIT-COM, a static task allocator which could be incorporated into an automated compiler/linker/loader for distributed processing systems, is presented. The allocator uses performance information for the processes making up the system in order to determine an appropriate mapping of tasks onto processors. It uses several heuristic extensions of the MULTIFIT bin-packing algorithm to find an allocation that will offer a high system throughput, taking into account the expected execution and interprocessor communication requirements of the software on the given hardware architecture. Throughput is evaluated by an asymptotic bound for saturated conditions and under an assumption that only processing resources are required. A set of options are proposed for each of the allocator's major steps. An evaluation was made on 680 small randomly generated examples. Using all the search options, an average performance difference of just over 1% was obtained. Using a carefully chosen small subset of only four options, a further degradation of just over 1.5% was obtained. The allocator is also applied to a digital signal processing system consisting of 119 tasks to illustrate its clustering and load balancing properties on a large system.> C. Murray Woodside, Gerald G. Monforton |
IEEE Trans. Parallel Distributed Syst. | 2 |