Shared Processors versus Shared Networks

نویسنده

  • Damas P. GRUSKA
چکیده

The time semantics of abstract programming languages is presented. It is based on an assumption that communicating processes do not share processors but that they may share communication network. It means that executions of actions cannot be interrupted during computations but that processes can wait for free communication links. The presented semantics is compared with the semantics based on an assumption that processes share processors.

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

ثبت نام

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

منابع مشابه

Modeling and Performance Evaluation of Multi-Processors Organization with Shared Memories

This paper is primarily concerned with theoretical evaluation of the performance of multiprocessors system. A markovian waiting line model has been developed for various different multi-processors configurations, with shared memory. The system is analysed at the request level rather than job level.

متن کامل

Speeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method

In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...

متن کامل

Semiotics of Collective Memory of the Iran-Iraq War (Holy Defence): A Case Study of the Shared Images in Virtual Social Networks

This study aims to achieve a semiotic understanding of collective memory of the Iran-Iraq war. For this purpose, samples of images in virtual social networks shared in response to the news of discovery and return of the bodies of more than 175 divers have been analyzed. Visual signs in photographs, cartoons, graphic designs, prints, paintings and posters, in methods of historical pictures and f...

متن کامل

Parallel DaSSF Discrete-Event Simulation without Shared Memory

The Dartmouth implementation of the Scalable Simulation Framework (DaSSF) is a discreteevent simulator used primarily in the simulation of networks. It achieves high performance through parallel processing. DaSSF 1.22 requires shared memory between all processors in order to operate. This limits the number of processors available and the hardware platforms that can exploit parallelism. We are i...

متن کامل

Evaluating Distributed Shared Memory for Parallel Numerical Applications

One method to evaluate a distributed shared memory(DSM) system is to analyze its performance for a variety of algorithms using a simulator. Eager DSM systems reduce latencies for remote data accesses by sending shared data changes immediately to all processors that may need it. Simulation results for two parallel application programs, Gaussian elimination and Fast Fourier Transform, are compare...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2007