A note on scheduling parallel unit jobs on hypercubes

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F09%3A00334962" target="_blank" >RIV/67985840:_____/09:00334962 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

A note on scheduling parallel unit jobs on hypercubes

Original language description

We study the problem of scheduling in independent 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. Jobs' intervals of feasibility have to be nested. We provide an polynomial time algorithm for the problem.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

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

2009

Confidentiality

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

Name of the periodical

International Journal of Foundations of Computer Science

ISSN

0129-0541

e-ISSN

—

Volume of the periodical

20

Issue of the periodical within the volume

2

Country of publishing house

SG - SINGAPORE

Number of pages

9

Pages from-to

—

UT code for WoS article

000265086600008

EID of the result in the Scopus database

—