Treffer: An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
Title:
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
Authors:
Source:
Theoretical computer science. 292(3):639-652
Publisher Information:
Amsterdam: Elsevier, 2003.
Publication Year:
2003
Physical Description:
print, 9 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Ordonnancement, Scheduling, sequencing, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Performances des systèmes informatiques. Fiabilité, Computer systems performance. Reliability, Algorithme déterministe, Deterministic algorithms, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Appariement, Pairing, Emparejamiento, Approche déterministe, Deterministic approach, Enfoque determinista, Contrainte précédence, Precedence constraint, Constreñimiento precedencia, Graphe biparti, Bipartite graph, Grafo bipartido, Ordonnancement processeur, Processor scheduling, Ordonnancement, Scheduling, Ordonamiento, Ordre, Order, Orden, Problème, Problem, Problema, Processeur, Processor, Procesador, Temps, Time, Tiempo, Utilisation, Use, Utilización, 68R10, Algorithme séquentiel, Sequential algorithm
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Humboldt University, Germany
Dept. de Llentguatges i Sistemes Informàtics. Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain
Computer Technology Institute, Riga Fereou 61, 26110 Patras, Greece
Dept. de Llentguatges i Sistemes Informàtics. Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain
Computer Technology Institute, Riga Fereou 61, 26110 Patras, Greece
ISSN:
0304-3975
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Operational research. Management
Mathematics
Operational research. Management
Accession Number:
edscal.14451174
Database:
PASCAL Archive
Weitere Informationen
We present here a new deterministic parallel algorithm for the two-processor scheduling problem. The algorithm uses only O(n3) processors and takes O(log2n) time on a CREW PRAM. In order to prove the above bounds we show how to compute in NC the lexicographically first matching for a special kind of convex bipartite graphs.