✦ LIBER ✦

Parallel Merge Sort with Load Balancing

✍ Scribed by Minsoo Jeon; Dongseung Kim

Book ID: 110410758
Publisher: Springer
Year: 2003
Tongue: English
Weight: 283 KB
Volume: 31
Category: Article
ISSN: 1573-7640
DOI: 10.1023/a:1021734202931

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Correction: Parallel Merge Sort

✍ Cole, Richard 📂 Article 📅 1993 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 131 KB

Parallel randomized load balancing

✍ Micah Adler; Soumen Chakrabarti; Michael Mitzenmacher; Lars Rasmussen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB

It is well known that after placing n balls independently and uniformly at ## Ž . random into n bins, the fullest bin holds ⌰ log nrlog log n balls with high probability. More recently, Azar et al. analyzed the following process: randomly choose d bins for each ball, and then place the balls, one

Parallel algorithms for merging and sort

Parallel algorithms for merging and sorting

✍ Narsingh Deo; Dilip Sarkar 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 638 KB

The parallel neighbour sort and 2-way me

The parallel neighbour sort and 2-way merge algorithm

✍ D.J Evans; Nadia Y Yousif 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 373 KB

Parallel CBIR implementations with load

Parallel CBIR implementations with load balancing algorithms

✍ José L. Bosque; Oscar D. Robles; Luis Pastor; Angel Rodríguez 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Data-parallel load balancing strategies

✍ Cyril Fonlupt; Philippe Marquet; Jean-Luc Dekeyser 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 456 KB