Fast Deterministic Processor Allocation

DOI10.1006/JAGM.1995.1023MaRDI QIDQ4837548zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

interval allocationprocessor allocation problem

Mathematics Subject Classification ID

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 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

Cited in

(9)

• An efficient processor allocation algorithm using two-dimensional packing
• Fast allocation and deallocation with an improved buddy system
• scientific article; zbMATH DE number 437523 (Why is no real title available?)
• Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds
• PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms
• scientific article; zbMATH DE number 19351 (Why is no real title available?)
• Parallel vertex colouring of interval graphs
• Fast and efficient processor allocation algorithm for torus-based chip multiprocessors
• More efficient parallel flow 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)