Fast Deterministic Processor Allocation
From MaRDI portal
Publication:4837548
DOI10.1006/JAGM.1995.1023zbMATH Open0828.68085OpenAlexW4254690835MaRDI QIDQ4837548FDOQ4837548
Authors: Torben Hagerup 
Publication date: 3 July 1995
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1995.1023
Recommendations
- scientific article; zbMATH DE number 437523
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms
- Fast parallel space allocation, estimation, and integer sorting
- Improved deterministic parallel integer sorting
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Cited In (9)
- More efficient parallel flow algorithms
- Fast and efficient processor allocation algorithm for torus-based chip multiprocessors
- Fast allocation and deallocation with an improved buddy system
- Title not available (Why is that?)
- Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds
- Parallel vertex colouring of interval graphs
- An efficient processor allocation algorithm using two-dimensional packing
- Title not available (Why is that?)
- PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms
This page was built for publication: Fast Deterministic Processor Allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4837548)
