๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Processor Efficient Parallel Matching

โœ Scribed by Piotr Sankowski

Publisher
Springer
Year
2007
Tongue
English
Weight
536 KB
Volume
42
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient dynamic processor allocation f
Efficient dynamic processor allocation for k-ary n-cube massively parallel processors
โœ Huey-Ling Chen; Chung-Ta King ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1002 KB

ln this paper, we study the problem of allocating processors to application tasks for massively parallel processors (MPPs). Tasks are assumed to arrive dynamically and request processors interconnected in specific topologies. We extend the free-list strategy previously proposed for hypercube systems

Processor Efficient Parallel Solution of
Processor Efficient Parallel Solution of Linear Systems of Equations
โœ Gilles Villard ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 65 KB

We present a deterministic parallel algorithm that solves a n-dimensional system Ax s b of linear equations over an ordered field or over a subfield of the complex ลฝ 2 . ลฝ ร„ ลฝ . 2 numbers. This algorithm uses O log n parallel time and O max M n , n ลฝ . 4 . ลฝ . log log n rlog n arithmetic processors