EDBT 2026 Demo / reviewers in the wild / expert
Maciej Machowiak
dblp:22/809
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2006
0000-0001-9609-6139ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
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 |
Electronic design automation · 33% Parallel and multicore computing · 33% Embedded and real-time systems · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › parallel scheduling
malleable task scheduling |
0.1 | 1 | 2006 | Preemptable Malleable Task Scheduling Problem · IEEE Trans. Computers 2006 |
Embedded and real-time systems › real-time scheduling
preemptive scheduling |
0.1 | 1 | 2006 | Preemptable Malleable Task Scheduling Problem · IEEE Trans. Computers 2006 |
Electronic design automation › high-level synthesis
scheduling |
0.1 | 1 | 2006 | Preemptable Malleable Task Scheduling Problem · IEEE Trans. Computers 2006 |
Methods — techniques the papers use, named apart from their topics
rectangle packing algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Preemptable Malleable Task Scheduling ProblemabstractThe problem of optimal scheduling n independent malleable tasks in a parallel processor system is studied. It is assumed that an execution of any task can be preempted and the number of processors allocated to the same task can change during its execution. We present a rectangle packing algorithm, which converts an optimal solution for the relaxed problem, in which the number of processors allocated to a task is not required to be integer, into an optimal solution for the original problem in O(n) time. Jacek Blazewicz, Mikhail Y. Kovalyov, Maciej Machowiak, Denis Trystram, Jan Weglarz |
IEEE Trans. Computers | 3 |
| 2001 | Approximation Algorithms for Scheduling Independent Malleable Tasks
Jacek Blazewicz, Maciej Machowiak, Grégory Mounié, Denis Trystram |
Euro-Par | 2 |