Buffered Banks in Multiprocessor Systems

نویسندگان

  • Kay A. Robbins
  • Steven Robbins
چکیده

A memory design based on logi cal banks is analyzed for shared memory mul tiprocessor systems In this design each phys ical bank is replaced by a logical bank consist ing of a fast register and subbanks of slower memory The subbanks are bu ered by in put and output queues which substantially re duce the e ective cycle time when the refer ence rate is below saturation The principal contribution of this work is the development of a simple analytical model which leads to scaling relationships among the e ciency the bank cycle time the number of processors the size of the bu ers and the granularity of the banks These scaling relationships imply that if the interconnection network has su cient bandwidth to support e cient access using high speed memory then lower speed memory can be substituted with little additional inter connection cost The scaling relationships are shown to hold for a full datapath vector sim ulation based on the Cray Y MP architecture The model is used to develop design criteria for a system which supports independent reference streams and the performance of this system is evaluated by simulation over a range of loading conditions keywords Bu ered memories logical mem ory banks memory con icts vector proces sors Cray Y MP

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

ثبت نام

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

منابع مشابه

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

C Language support for multiprocessor application environments

The purpose of this paper is to start the dialog that must inevitably precede making a clear decision on the emerging issue of support for multiprocessor applications. This paper is meant to define the problem, its terms and current solutions and some of the possible alternatives. This paper is not proposing a specific C language solution to language support for multiprocessor systems. There ma...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Analysis of Memory Interference in Buffered Multiprocessor Systems in Presence of Hot Spots and Favorite Memories

We present a discrete Markov chain model for analyzing the effect of memory interference in processor-memory interconnections of buffered multiprocessor systems. Each module is assumed to be one of the following three types – hot memory, favorite memory and memory which is neither hot nor favorite. The analytical solutions are restricted to 2 M andN 2 systems, where N andM are respectively the ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 44  شماره 

صفحات  -

تاریخ انتشار 1995