𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the scalability of PSRS algorithm

✍ Scribed by Nai-jie Gu; Guo-Iiang Chen

Publisher
Wuhan University
Year
1996
Tongue
English
Weight
286 KB
Volume
1
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scalability of the Bayesian optimization
Scalability of the Bayesian optimization algorithm
✍ Martin Pelikan; Kumara Sastry; David E. Goldberg πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 547 KB

To solve a wide range of different problems, the research in black-box optimization faces several important challenges. One of the most important challenges is the design of methods capable of automatic discovery and exploitation of problem regularities to ensure efficient and reliable search for th

Pairs of pulsars (PSR) and the origin of
Pairs of pulsars (PSR) and the origin of PSR
✍ Massimo Fracassini; Paola Maggi; Laura E. Pasinetti πŸ“‚ Article πŸ“… 1986 πŸ› Springer Netherlands 🌐 English βš– 355 KB
On the Scalability of Asynchronous Paral
On the Scalability of Asynchronous Parallel Computations
✍ D.C. Marinescu; J.R. Rice πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 753 KB

This paper investigates the time lost in a parallel computation due to sequential and duplicated work, communication, and blocking, and proposes characterizations of parallel algorithms based upon the communication complexity and the blocking model. It discusses the impact of the processor's archite