✦ LIBER ✦

Speedup and optimality in pipeline programs

✍ Scribed by Jason Gait

Publisher: Springer
Year: 1989
Tongue: English
Weight: 594 KB
Volume: 18
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf01407860

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Program Speedup in a Heterogeneous Compu

Program Speedup in a Heterogeneous Computing Network

✍ V. Donaldson; F. Berman; R. Paturi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 597 KB

Program speedup is an important measure of the performance of an algorithm on a parallel machine. Of particular importance is the near linear or superlinear speedup exhibited by the most performance-efficient algorithms for a given system. We describe network and program models for heterogeneous net

Predicting and Bounding the Speedup of M

Predicting and Bounding the Speedup of Multithreaded Solaris Programs

✍ Lars Lundberg 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 180 KB

In Solaris, threads are frequently relocated. The data associated with a relocated thread have to be moved from the cache of the old processor to the new processor. In order to avoid poor memory performance due to thread relocation, threads can be bound to processors static scheduling. Finding a sta

Pipelined programming in PVM

✍ G. Dodero; R. Valia 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 641 KB

Pipelining in multi-query optimization

✍ Nilesh N. Dalvi; Sumit K. Sanghai; Prasan Roy; S. Sudarshan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 796 KB

Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plans that share common results. Current approaches to multi-query optimization assume that common subexpressions are materia

Data dependence in simple and compound p

Data dependence in simple and compound program pipelines

✍ A. P. Kovtushenko 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 752 KB

Parallel program analysis on workstation

Parallel program analysis on workstation clusters: speedup profiling and latency hiding

✍ Togneri, R. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

Parallel programming on workstation clusters is subject to many factors and problems which determine the potential success or failure of any individual implementation. The most obvious problems are the difficulty in developing parallel algorithms and the high communication latency which may render s