Approximate throughput maximization in scheduling of parallel jobs on hypercubes

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F10%3A00371008" target="_blank" >RIV/67985840:_____/10:00371008 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Approximate throughput maximization in scheduling of parallel jobs on hypercubes
Original language description
We study scheduling of unit-time parallel jobs on hypercubes. A parallel job has to be scheduled between its release time and deadline on a subcube of processors. The objective is to maximize the number of early jobs. We provide an efficient 1.5-approximation algorithm for the problem.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Information Technologies - Applications and Theory
ISBN
978-80-970179-4-1
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
71-75
Publisher name
Pont
Place of publication
Seňa
Event location
Smrekovica
Event date
Sep 21, 2010
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)