An approach to parallel algorithm design

DOI10.1051/ITA/1993270200851MaRDI QIDQ5286057zbMATH OpenOpenAlexFDO

Authors George F. Georgakopoulos, Andreas Stafylopatis

Publication date 29 June 1993

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92445

zbMATH Keywords

NP-completeparallel processorsPoint symmetric graphstask assignmenttask graphs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 3941253
• Scheduling tree dags on parallel architectures
• Optimal parallel processing of random task graphs
• An algorithm for the multiprocessor assignment problem

Cites work

• Author's Reply to Vergin's Note on the Paper “Lot Size Scheduling on a Single Machine for Stochastic Demand”
• Does co-NP have short interactive proofs ?
• scientific article; zbMATH DE number 53193 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Vertex-transitive graphs

Cited in

(21)

• On mapping processes to processors in distributed systems
• Holistic algorithms: A paradigm for multiprocessor programming
• Parallel algorithms for redundant precedence relations elimination in task systems
• Optimal parallel scheduling for the 2-steps graph with constant task cost
• Scheduling parallel I/O operations in multiple bus systems
• Design of parallel algorithms for the single resource allocation problem
• scientific article; zbMATH DE number 1728439 (Why is no real title available?)
• Processor Scheduling for Linearly Connected Parallel Processors
• scientific article; zbMATH DE number 30939 (Why is no real title available?)
• scientific article; zbMATH DE number 42110 (Why is no real title available?)
• scientific article; zbMATH DE number 107589 (Why is no real title available?)
• Layouts for improved hierarchical parallel computations
• scientific article; zbMATH DE number 3570347 (Why is no real title available?)
• scientific article; zbMATH DE number 370481 (Why is no real title available?)
• scientific article; zbMATH DE number 1294384 (Why is no real title available?)
• scientific article; zbMATH DE number 598111 (Why is no real title available?)
• scientific article; zbMATH DE number 1884457 (Why is no real title available?)
• scientific article; zbMATH DE number 1894382 (Why is no real title available?)
• scientific article; zbMATH DE number 1916815 (Why is no real title available?)
• scientific article; zbMATH DE number 838793 (Why is no real title available?)
• Graph models for scheduling systems with machine saturation property

This page was built for publication: An approach to parallel algorithm design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286057)