✦ LIBER ✦

Parallel VLSI test in a shared-memory multiprocessor

✍ Scribed by Gil, C. ;Ortega, J. ;Montoya, M. G.

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 214 KB
Volume: 12
Category: Article
ISSN: 1040-3108
DOI: 10.1002/1096-9128(20000425)12:5<311::aid-cpe492>3.0.co;2-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Macromolecular dynamics on a shared-memo

Macromolecular dynamics on a shared-memory multiprocessor

✍ Robert D. Skeel 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB

This is a study of the effect of data structures and algorithms on parallelism and vectorization for the molecular dynamics package GROMOS. About 80% of the computing time (for the GROMOS benchmark) is spent on the nonbonded interactions, and an important issue is the method that is used for finding

Cache-Based Synchronization in Shared Me

Cache-Based Synchronization in Shared Memory Multiprocessors

✍ Umakishore Ramachandran; Joonwon Lee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 343 KB

Parallel Satisfiability Test with Synchr

Parallel Satisfiability Test with Synchronous Simulated Annealing on Distributed-Memory Multiprocessor

✍ Andrew Sohn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables. This report presents a practical approach to solving the Random L-SAT Problem on a large-scale distrib

Comparing Processor Allocation Strategie

Comparing Processor Allocation Strategies in Multiprogrammed Shared-Memory Multiprocessors

✍ Kelvin K. Yue; David J. Lilja 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Decentralized remapping of data parallel

Decentralized remapping of data parallel applications in distributed memory multiprocessors

✍ Xu, Chengzhong; Lau, Francis C. M.; Diekmann, Ralf 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

In this paper we present a decentralized remapping method for data parallel applications on distributed memory multiprocessors. The method uses a generalized dimension exchange (GDE) algorithm periodically during the execution of an application to balance (remap) the system's workload. We implemente

Integrating Fine-Grained Message Passing

Integrating Fine-Grained Message Passing in Cache Coherent Shared Memory Multiprocessors

✍ David K. Poulsen; Pen-Chung Yew 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 397 KB

This paper considers the use of data prefetching and an alternative mechanism, data forwarding, for reducing memory latency caused by interprocessor communication in cache coherent, shared memory multiprocessors. Data prefetching is accomplished by using a multiprocessor software pipelined algorithm