π
π
The Cartographer
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems
November 28, 2018 Β· Declared Dead Β· π Sibirskie Elektronnye Matematicheskie Izvestiya
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Alexander Kononov, Yulia Kovalenko
arXiv ID
1811.11595
Category
cs.DS: Data Structures & Algorithms
Citations
0
Venue
Sibirskie Elektronnye Matematicheskie Izvestiya
Last Checked
5 months ago
Abstract
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new constant factor approximation algorithms for the non-migratory cases when all jobs have a common release time and/or a common deadline.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted