Analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory

نویسندگان

  • N. A. Ezhova
  • Leonid B. Sokolinsky
چکیده

Работа посвящена аналитическому исследованию масштабируемости фреймворка организации параллельных вычислений по схеме «мастер-рабочие» применительно к многопроцессорным системам с распределенной памятью. В статье строится новая модель параллельных вычислений BSF, основанная на моделях BSP, и SPMD. Модель BSF ориентирована на вычислительные задачи с высокой временной сложностью. Определяется архитектура BSF-компьютера и описывается структура BSF-программы. Описывается формальная стоимостная метрика, с помощью которой получаются верхние оценки масштабируемости параллельных программ, основанных на модели BSF, применительно к вычислительным системам с распределенной памятью. Также выводятся формулы для оценки эффективности распараллеливания BSF-программ.

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

ثبت نام

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

منابع مشابه

Analytical Estimation of Scalability of Iterative Numerical Algorithms on Distributed Memory Multiprocessors

The article presents a new high-level parallel computational model named BSF – Bulk Synchronous Farm. The BSF model extends the BSP model to deal with the compute-intensive iterative numerical methods oriented to the distributed-memory multiprocessor systems. The BSF model is based on master-worker paradigm and SPMD programming model. The BSF model allows to predict the upper scalability bound ...

متن کامل

Workload Characterization and Locality Management for Coarse-grain Multiprocessors 1 Workload Characterization and Locality Management for Coarse-grain Multiprocessors

Scalable shared memory multiprocessors commonly employ replication and the associated coherency maintenance of memory blocks, but diier in the granularity from ne-grain (cache-coherent multiproces-sors) to coarse-grain (page-based distributed shared memory systems). Regardless of the size of coherency blocks, attaining good performance may depend on the number of copies staying small. Previous ...

متن کامل

Computation and Data Partitioning on Scalable Shared Memory Multiprocessors

In this paper we identify the factors that affect the derivation of computation and data partitions on scalable shared memory multiprocessors (SSMMs). We show that these factors necessitate an SSMM-conscious approach. In addition to remote memory access, which is the sole factor on distributed memory multiprocessors, cache affinity, memory contention and false sharing are important factors that...

متن کامل

Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture

Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...

متن کامل

On the Distribution of Directory Information in a Software Controlled Distributed Shared Memory System

Distributed Shared Memory is a good solution to the scalability, complexity and high cost problems of large scale Shared Memory Multiprocessors, as well as to the difficulty of the programming model problem of the message passing Distributed Memory Multiprocessors. During recent years many software Distributed Shared Memory systems, operating on top of the Message Passing system have appeared. ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • CoRR

دوره abs/1704.05816  شماره 

صفحات  -

تاریخ انتشار 2017