✦ LIBER ✦

On the Scalability of Data-Parallel Decomposition Algorithms for Stochastic Programs

✍ Scribed by R.J. Qi; S.A. Zenios

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 461 KB
Volume: 22
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1994.1112

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Utility of Communication–Computat

On the Utility of Communication–Computation Overlap in Data-Parallel Programs

✍ Michael J. Quinn; Philip J. Hatcher 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 260 KB

However, the speedup achieved through parallelism is often lower in modern systems. It is no surprise, then, that developers of compilers for data-parallel languages have hypothesized the importance of optimizations that overlap communications with computations in order to reduce execution times and

Programming for the DNA analysis of FCM

Programming for the DNA analysis of FCM data on an IBM microcomputer

✍ Edward J. Pavlik; Robert C. Flanigan; Jonathan Bartmas; John R. Van Nagell Jr.; 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 391 KB

Programming for the dna analysis of FCM

Programming for the dna analysis of FCM data on an IBM computer

✍ Dirk R. Van Bockstaele 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

Comments on the DATa ANalysis (DATAN) al

Comments on the DATa ANalysis (DATAN) algorithm and rank annihilation factor analysis for the analysis of correlated spectral data

✍ Karl S. Booksh; Bruce R. Kowalski 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

Efficient algorithm for “on-the-fly” err

Efficient algorithm for “on-the-fly” error analysis of local or distributed serially correlated data

✍ David R. Kent IV; Richard P. Muller; Amos G. Anderson; William A. Goddard III; M 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

## Abstract We describe the Dynamic Distributable Decorrelation Algorithm (DDDA) which efficiently calculates the true statistical error of an expectation value obtained from serially correlated data “on‐the‐fly,” as the calculation progresses. DDDA is an improvement on the Flyvbjerg‐Petersen renor

Call for Papers: Special Issue of the Jo

Call for Papers: Special Issue of the Journal of Parallel and Distributed Computing on High Performance Data Mining

📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 165 KB

The past decade has seen explosive growth in database technology and the amount of data collected. Advances in data collection, use of bar codes in commercial outlets, and the computerization of business transactions have flooded us with lots of data. We have an unprecedented opportunity to analyze