#### Filter Results:

#### Publication Year

1993

2014

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We give asymptotically equal lower and upper bounds for the number of parallel 1/0 operations required to perform BMMC permutations (defined by a characteristic matrix that is nonsingular over GF(2)) on parallel disk systems. Under the Vitter-Shriver parallel-disk model with N records, D disks, block size B, and M records of RAM, we show a universal lower… (More)

We present the design and implementation of a parallel out-of-core sorting algorithm, which is based on Leighton's columnsort algorithm. We show how to relax some of the steps of the original columnsort algorithm to permit a faster out-of-core implementation. Our algorithm requires only 4 passes over the data, and a 3-pass implementation is possible.… (More)

The policies and mechanisms for migrating processes in a distributed system become more complicated in a heterogeneous environment, where the hosts may diier in their architecture and operating systems. These distributed systems include a large quantity and great diversity of resources which m a y not be fully utilized without the means to migrate processes… (More)

—Research computing in the social sciences requires access to statistical software and quantitative tools that perform embarrassingly parallel computation at moderate scale, large memory to fit entire data sets, and secure storage for potentially confidential data. The Research Computing Environment (RCE) was designed as a three-tier system to satisfy these… (More)

- Terry Dontje, Don V. Kerr, Daniel Lacher, Pak Lui, Ethan Mallove, Karen Norteman +2 others
- Parallel Tools Workshop
- 2008

- Sean S B Moore, Leonard F Wisniewski
- 1999

The fast cosine transform algorithms introduced in ST91, Ste92] require fewer operations than any other known general algorithm. Similar to related fast transform algorithms (e.g., the FFT), these algorithms permute the data before, during, or after the computation of the transform. The choice of this permutation may be an important consideration in… (More)

We g i v e asymptotically equal lower and upper bounds for the number of parallel I/O operations required to perform BMMC permutations (dened by a c haracteristic matrix that is nonsingular over GF(2)) on parallel disk systems. Under the Vitter-Shriver parallel-disk model with N records, D disks, block s i z e B, a n d M records of RAM, we s h o w a… (More)

We g i ve a symptotically equal l o wer and upper bounds for the number of parallel I/O o p e rations required to perform bit-matrix-multiply/complement (B M M C) p e r m utations on parallel disk systems. In a BMMC permutation o n N records, where N is a power of 2, e a c h (l g N)-bit source address x maps to a corresponding (lg N)-bit target address y by… (More)

The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read the records of a data set from a source portion of data storage, permute them in memory, and write them to a separate target portion of the same size. It can be quite expensive,… (More)

- ‹
- 1
- ›