PVM: a framework for parallel distributed computing
Concurrency: Practice and Experience
Lazy release consistency for software distributed shared memory
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Implementing an irregular application on a distributed memory multiprocessor
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Replication techniques for speeding up parallel applications on distributed systems
Concurrency: Practice and Experience
Best-first search methods for constrained two-dimensional cutting stock problems
Operations Research
Weak ordering—a new definition
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem
IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Abstract stations is a significant contribution towards the OR practice. This paper describes the design and implementation of a solution to the constrained 2-D cutting stock problem on a cluster of workstations. The constrained 2-D cutting stock problem is an irregular problem with a dynamically modified global data set and irregular amounts and patterns of communication. A replicated data structure is used for the parallel solution since the ratio oft-ends to writes is known to be large. Mutual exclusion and consistency are maintained using a token-bused lazy consistency mechanism, and a randomized protocol for dynamically balancing the distributed work queue is employed. Speedups are reported for three benchmark problems executed on a cluster of workstations interconnected by a IO Mbps Ethernet.