Mark H. Nodine

Learn More
We present an elegant deterministic load balancing strategy for distribution sort that is applicable to a wide variety of parallel diska and parallel memory hierarchies with both single and parallel processors. The simplest application of the strategy is an optimal deterministic algorithm for external sorting with multiple disks and parallel processors. In(More)
We present several algorithms for sorting efficiently with parallel two-level and multilevel memories. Our main result is an elegant, easy-toimplement, optimal, deterministic algorithm for external sorting with P disk drives. This result answers the open problem posed by Vitter and Shriver. Our measure of performance is the number of parallel input/output(More)
We present several e cient algorithms for sorting on the uniform memory hierarchy (UMH), introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and nearly-optimal algorithms for a wide range of bandwidth degradations, including a parsimonious algorithm for constant bandwidth. We also develop optimal sorting algorithms for all(More)
We present a load balancing technique that leads to an optimal deterministic algorithm called Balance Sort for external sorting on multiple disks. Our measure of performance is the number of input/output (I/O) operations. In each I/O, each of the D disks can simultaneously transfer a block of data. Our algorithm improves upon the randomized optimal(More)
This paper gives an overview of methods proposed for implementing multi-valued logic in CMOS and then describes Intrinsity’s patented Fast14 R © Technology as a mature methodology for silicon implementation of multi-valued logic. To the authors’ knowledge, no previous method of implementing multi-valued logic has been demonstrated with a design of the(More)
We present a practical deterministic load balancing strategy for distribution sort that is applicable to parallel disks and parallel memory hierarchies with both single and parallel processors. The simplest application of the strategy is an optimal deterministic algorithm called Balance Sort for external sorting on multiple disks with a single CPU, as(More)
In this paper we introduce inputloutput (I/O) overhead .1c, as a complexity measure for VLSI implementations of two-dimensional lattice computations of the type arising in the simulation of physical systems. We show by pebbling arguments that .1c, = s2(n-’) when there are n2 processing elements available. If the results are required to be observed at every(More)