Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems
DOI10.1006/jpdc.1995.1092zbMath0833.68015OpenAlexW1993045886MaRDI QIDQ1898204
V. Rajaraman, Kamal Kumar Jain
Publication date: 24 September 1995
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1995.1092
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
This page was built for publication: Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems
