scientific article; zbMATH DE number 425387

zbMATH Open0786.68002MaRDI QIDQ3136502FDOQ3136502

Vijay K. Naik

Publication date: 4 October 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

matrix factorizationdirected acyclic graphmultiprocessingcomputation and communication trade-offsdagsperformance of parallel computations

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Theory of operating systems (68N25)

Cited In (1)

• On interprocess communication. II: Algorithms

   Recommendations

• Towards an Architecture-Independent Analysis of Parallel Algorithms 👍 👎
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays 👍 👎
• Communication complexity of the Gaussian elimination algorithm on multiprocessors 👍 👎
• A Communication-Time Tradeoff 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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