摘要:

AbstractWe examine parallel‐processing applications to the analysis of large data sets typically used in social science research. Our research uses a parallel environment which makes it possible to have 1024 processors working simultaneously on a problem. The application is tested using various configurations of number of processors and block‐size of data reads on the estimation of a linear model of earnings for the California portion of the 15% sample of the 1970 Census. Performance factors assessed include total execution time, speed‐up and efficiency. Execution times are also compared with reference to execution times on an IBM 3081 using SPSS‐X. Results indicate that optimal configurations of number of processors and data block‐size can produce significantly faster execution times for linear model estimation on relatively large (80,000 cases) data sets. We also discuss other applications of parallel processing to statistical analyses commonly found in socia

ISSN:1040-3108    

DOI:10.1002/cpe.4330040302

出版商:John Wiley&Sons, Ltd    

年代:1992

数据来源: WILEY

摘要:

AbstractWe evaluate the basic performance of the Intel iPSC/860 computer, which can have up to 128 Intel i860‐based nodes connected together with a hypercube network topology. After giving a brief overview of the system, the properties and bottlenecks of the hardware architecture and software environment are discussed. Basic memory, scalar and vector performance of a single node is evaluated, and the communication performance and the overlap of computation and communication are analyse

ISSN:1040-3108    

DOI:10.1002/cpe.4330040303

出版商:John Wiley&Sons, Ltd    

年代:1992

数据来源: WILEY

摘要:

AbstractSorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound ofO(N)forNparticles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimum performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analysed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.

ISSN:1040-3108    

DOI:10.1002/cpe.4330040304

出版商:John Wiley&Sons, Ltd    

年代:1992

数据来源: WILEY

摘要:

AbstractAlgorithms for synchronizing the times and frequencies of the clocks of Intel and Ncube hypercube multiprocessors are presented. Bounds for the error in estimating clock offsets and frequencies are formulated in terms of the clock read error and message transmission time. Clock and communication performance of the Ncube and Intel hypercubes are analysed, and performance of the synchronization algorithms is presented.

ISSN:1040-3108    

DOI:10.1002/cpe.4330040305

出版商:John Wiley&Sons, Ltd    

年代:1992

数据来源: WILEY

ISSN:1040-3108    

DOI:10.1002/cpe.4330040301

出版商:John Wiley&Sons, Ltd    

年代:1992

数据来源: WILEY