About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Perfectly overlapped generation of long runs on a transputer array for sorting
Abstract
Parallel algorithms are presented for generation of long sorted runs as the first phase of sorting a large file. They can generate runs of length about 2mp on a one-way linear array of p processors each with a heap of size m. Internal computations can be completely overlapped with I/O, and most of the output time can be overlapped with the input time; thus, almost only input time is required. Experiments with the algorithms and their variations have been conducted using transputers. Although the data transfer between transputers is restricted to only a single direction, the experimental results show that all the versions can generate longer runs than a previous algorithm for a two-way transputer array. © 1997 Elsevier Science B.V. © 1997 Elsevier Science B.V.
Related
Conference paper
Automatic argument quality assessment - New datasets and methods
Conference paper
End-to-end argumentation knowledge graph construction
Conference paper