Throughput Maximization in Multiprocessor Speed-Scaling
DOI10.1007/978-3-319-13075-0_20zbMATH Open1433.68063arXiv1402.3782OpenAlexW2356268455MaRDI QIDQ2942633FDOQ2942633
Authors: Vincent Chau, Nguyen Kim Thang, Eric Angel, Evripidis Bampis
Publication date: 11 September 2015
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.3782
Recommendations
- Throughput maximization in multiprocessor speed-scaling
- scientific article; zbMATH DE number 1929944
- Throughput maximization in the speed-scaling setting
- On maximizing the throughput of multiprocessor tasks.
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor
- Throughput maximization for speed scaling with agreeable deadlines
- Throughput maximization for speed-scaling with agreeable deadlines
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- Speed scaling on parallel processors
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Energy efficient scheduling and routing via randomized rounding
- Energy-efficient algorithms for non-preemptive speed-scaling
- Non-preemptive speed scaling
- On multi-processor speed scaling with migration
- The bell is ringing in speed-scaled multiprocessor scheduling
- How to pack your items when you have to buy your knapsack
- New Results for Non-Preemptive Speed Scaling
- Title not available (Why is that?)
- Throughput maximization in the speed-scaling setting
- Tradeoff between energy and throughput for online deadline scheduling
- Scheduling for Speed Bounded Processors
- Speed scaling on parallel processors with migration
- Speed scaling on parallel processors
- Green scheduling, flows and matchings
- Throughput maximization for speed-scaling with agreeable deadlines
- From preemptive to non-preemptive speed-scaling scheduling
- Online matching with concave returns
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Cited In (12)
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- Throughput maximization in multiprocessor speed-scaling
- Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms
- On maximizing the throughput of multiprocessor tasks.
- Multiprocessor Capacity Metric and Analysis
- Throughput maximization for speed-scaling with agreeable deadlines
- Throughput maximization in the speed-scaling setting
- On multi-processor speed scaling with migration
- The effect of multiprocessor radius on scaling
- Non-preemptive throughput maximization for speed-scaling with power-down
- Throughput maximization for speed scaling with agreeable deadlines
- Maximizing the Throughput of Multiple Machines On-Line
This page was built for publication: Throughput Maximization in Multiprocessor Speed-Scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942633)