𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel Implementations of the Selection Problem: A Case Study

✍ Scribed by Marc Daumas; Paraskevas Evripidou

Book ID
110250928
Publisher
Springer
Year
2000
Tongue
English
Weight
494 KB
Volume
28
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The parallel implementation of configura
The parallel implementation of configuration-selecting multireference configuration interaction method
✍ Stampfuss, P.; Wenzel, W.; Keiter, H. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 266 KB πŸ‘ 1 views

We report on a scalable implementation of the configurationselecting multireference configuration interaction method for massively parallel architectures with distributed memory. Based on a residue driven evaluation of the matrix elements, this approach allows the routine treatment of Hilbert spaces

Design and implementation of a parallel
Design and implementation of a parallel solution to the cutting stock problem
✍ Nicklas, Lisa D.; Atkins, Robert W.; Setia, Sanjeev K.; Wang, Pearl Y. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 427 KB πŸ‘ 3 views

The constrained 2D cutting stock problem is an irregular problem with dynamic data structures, highly variable amounts of computation per task, and unpredictable amounts and patterns of communication. This paper describes the design and implementation of a parallel solution to this problem on a clus

A Parallel Implementation of the Push-Re
A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem
✍ R. Anderson; J.C. Setubal πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 1002 KB

We describe an efficient parallel implementation of the pushrelabel maximum flow algorithm for a shared-memory multiprocessor. Our main technical innovation is a method that allows the "global relabeling" heuristic to be executed concurrently with the main algorithm; this heuristic is essential for