𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Analysis of the performance of the parallel quicksort method

✍ Scribed by D. J. Evans; Nadia Y. Yousif

Book ID
105403734
Publisher
Springer Netherlands
Year
1985
Tongue
English
Weight
398 KB
Volume
25
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Performance analysis of parallel FDTD me
Performance analysis of parallel FDTD method on the different platforms
✍ Wenhua Yu; Yongjun Liu; Xiaoling Yang; Raj Mittra; Yongquan Lu; Pai Wang; Qing C πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 132 KB

## Abstract In this communication, we investigate the performance of parallel FDTD code on a Gigabit Ethernet and optical network. It is fact that the optical network is necessary for a large cluster due to its wide bandwidth and small latency. However, for a small cluster, the Gigabit Ethernet wil

Probabilistic analysis of the time compl
Probabilistic analysis of the time complexity of quicksort
✍ Tadashi Mizoi; Shunji Osaki πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 460 KB

## Abstract Quicksort is a well‐known sorting algorithm based on the divided control. the array to be sorted is divided into two sets as follows. an element in the array is specified, and the set of values larger than the value of that element and the set of values smaller than that value are const