#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1992

2011

- This year (0)
- Last five years (0)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Darrell R. Ulm, Johnnie W. Baker
- ICPP
- 1998

The ASC MSIMD model for parallel computation supports a generalized version of an associative style of computing that has been used since the introduction of associative SIMD computers in the early 1970's. In particular, this model supports data parallelism, constant time maximum and minimum operations, one or more instruction streams ISs which are sent to… (More)

- Darrell R. Ulm, Johnnie W. Baker
- PDPTA
- 1996

This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed into a knapsack of size L W and are only obtainable with guillotine-type side to side cuts. The parallel algorithm is described and analyzed for the associative model. The… (More)

- Darrell R. Ulm, Johnnie W. Baker
- ICPP
- 1995

- Darrell R. Ulm, Johnnie W. Baker
- PDPTA
- 1996

The ASC model for parallel computation supports a generalization of an associative style of computing that has been used since the introduction of associative SIMD computers in the early 1970's. In particular, this model supports data parallelism, constant time maximum and minimum operations, one or more instruction streams ISs which are sent to an equal… (More)

- Darrell R. Ulm, Johnnie W. Baker, Michael Scherger
- 18th International Parallel and Distributed…
- 2004

Summary form only given. This paper describes a parallel solution of the sequential dynamic programming method for solving a NP class, 2D knapsack (or cutting-stock) problem which is the optimal packing of multiples of n rectangular objects into a knapsack of size L/spl times/W and are only obtainable with guillotine-type (side to side) cuts. Here, we… (More)

- Darrell R. Ulm, Pearl Y. Wang
- ICPP
- 1992

Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms. Parallel computational models proposed after PRAM address short comings of PRAM in terms of modeling realism of actual machines. In this work, we propose a multiple instruction… (More)

- Darrell R. Ulm
- IEEE Distributed Systems Online
- 2004

A review of "Web Intelligence"By Ning Zhong, Jiming Liu, and Yiyu Yao, eds.

- Darrell R. Ulm, Michael Scherger
- 19th IEEE International Parallel and Distributed…
- 2005

Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms. Parallel computational models proposed after PRAM address short comings of PRAM in terms of modeling realism of actual machines. In this work, we propose a multiple instruction… (More)

- M Scherger, D J Kerbyson, R Rajamony, D R Ulm
- 2011

- ‹
- 1
- ›