Multiprocessing linear algebra algorithms on the CRAY X-MP-2: Experiences with small granularity

نویسندگان

  • Steve S. Chen
  • Jack J. Dongarra
  • Christopher C. Hsiung
چکیده

“Multiprocessor” is a term that has been used for years. Our definition follows those of [8], [9], and [lo]. The CRAY X-MP is a follow-up to the CRAY-1S system offered by CRAY Research, Inc. The CRAY X-MP family is a general-purpose multiprocessor systeln. It inherits the basic vector functions of CRAY-lS, with major architectural improvements for each individual processor. The interprocessor communication mechanism and the provision of Solid-State Disk device(SSD) are new designs that create tremendous potential in the realm of high-speed computing. The CRAY X-MP-2 system is the first product of the CRAY X-MP family.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Task granularity studies on a many-processor CRAY X-MP

A hybrid granularity model is proposed for general concurrent solution. It is applied to the triangular factorization of a dense matrix ranging in size from 4 to 1024. Concurrency is achieved at two levels: (!) with small (micro) task granularity and (2) with large (blocked) task granularity. Rdevano~ to a many-proccssax CRAY X-MP is demonstrated by simulation.

متن کامل

Divide and Conquer: A New Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...

متن کامل

Block Implementations of the Symmetric Qrand Jacobi

A common approach to solve problems in numerical linear algebra eeciently on modern high speed computers is to redesign the classical algorithm, which was originally developed for serial computers. In this paper, we discuss block variants of QR and Jacobi algorithms for the computation of the complete spectral decomposition of symmetric matrices. We report on numerical tests, which have been pe...

متن کامل

FFTs in External or Hierarchical

Conventional algorithms for computing large one-dimensional fast Fourier transforms (FFTs), even those algorithms recently developed for vector and parallel computers, are largely unsuitable for systems with external or hierarchical memory. The principal reason for this is the fact that most FFT algorithms require at least m complete passes through the data set to compute a 2 m-point FFT. This ...

متن کامل

POOCLAPACK: Parallel Out-of-Core Linear Algebra Package

In this paper parallel implementation of out-of-core Cholesky factorization is used to introduce the Parallel Outof-Core Linear Algebra Package (POOCLAPACK), a flexible infrastructure for parallel implementation of out-of-core linear algebra operations. POOCLAPACK builds on the Parallel Linear Algebra Package (PLAPACK) for in-core parallel dense linear algebra computation. Despite the extreme s...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1984