The mpC parallel programming language is an ANSI C superset based on the notion of a network comprising processor nodes of different types connected with links of different lengths. It allows the user to describe a ne...
详细信息
The mpC parallel programming language is an ANSI C superset based on the notion of a network comprising processor nodes of different types connected with links of different lengths. It allows the user to describe a network topology, create and discard networks, distribute data and computations over networks. The paper describes the implementation of managing networks in the mpC programming environment.
This paper investigates the use of ATM for cluster based computing. The need for a native ATM API is discussed as well as the performance of message passing libraries (MPL) that are written to use such an API to explo...
详细信息
This paper investigates the use of ATM for cluster based computing. The need for a native ATM API is discussed as well as the performance of message passing libraries (MPL) that are written to use such an API to exploit the advantages of a high-speed network for cluster-based computing. The MPLs offer a standard interface, such as PVM or MPI, and interoperate with existing TCP/IP and UDP/IP based versions in addition to the ATM API environment. The interoperability extensions made to two MPLs, MPI and Prowess, are described with a hybrid environment of both ATM and TCP-based legacy network technology. The native ATM API is described in this paper which supports cluster based computing that may be geographically distributed. Furthermore, this API provides a reliable transport interface to the MPL which has been optimized for an ATM environment. The transport protocol is a low-state design that optimizes the performance based on the available bandwidth, buffer constraints, propagation delay characteristics, and security requirements of a particular connection, and will rapidly evolve if the connection characteristics change.
In page-baseddistributed shared memory systems, a large page size makes efficient use of interconnection network, but increases the chance of false sharing, while a small page size reduces the level of false sharing ...
详细信息
In page-baseddistributed shared memory systems, a large page size makes efficient use of interconnection network, but increases the chance of false sharing, while a small page size reduces the level of false sharing but results in an inefficient use of the network. This paper proposes a technique that uses process affinity to achieve data pages clustering so as to optimize the temporal data locality on DSM systems, and therefore reduces the chance of false sharing and improves the data locality. To quantify the degree of process affinity for a piece of data, a measure called process affinity index is used that indicates the closeness between this piece of data and the process. Simulation results show that process affinity technique improves the execution performance as page size increases due to the effective reduction of fair sharing. In the best case an order of magnitude performance improvement is achieved.
parallelprocessing can be taught effectively even though parallel hardware is not available. Free software is available to support the three major paradigms of parallel computing. Parallaxis is a software simulator t...
详细信息
parallelprocessing can be taught effectively even though parallel hardware is not available. Free software is available to support the three major paradigms of parallel computing. Parallaxis is a software simulator that is based on the SIMD model. PVM and MPI allow one to treat a network of workstations as a message passing MIMD multicomputer with distributed memory. A locally developed shared memory simulator supports the MIMD model of computing with a common shared memory. While none of these products is superior to an actual parallel computer, each can be used in a variety of courses to give students experience with parallel algorithms.
OSI Management model defines only peer to peer communication process between a managing application (AP) and a managed AP. Thus, when more than one managed AP stores portions of Management Information Base (MIB) distr...
详细信息
OSI Management model defines only peer to peer communication process between a managing application (AP) and a managed AP. Thus, when more than one managed AP stores portions of Management Information Base (MIB) distributively, the managing AP needs a sophisticated distributedprocessing function. This paper proposes an agent, called Management System Agent (MSA) which provides location transparency and schema transparency of MIB for managing APs, to ease the realization of managing APs. Location transparency hides the distribution of MIB from managing APs. Schema transparency also enables managing APs to invoke management operation on unified schema. This paper demonstrates the effectiveness of the MSA model through applying it to implementation of Customer network Management (CNM) system focusing X.25 public data networks.
The Gamma programming paradigm is based on the multiset data structure. In this model a succession of chemical reactions consume the elements of the multiset or multiset of tuples, and produce new elements according t...
详细信息
The Gamma programming paradigm is based on the multiset data structure. In this model a succession of chemical reactions consume the elements of the multiset or multiset of tuples, and produce new elements according to specific rules. This paper describes how the Gamma paradigm can be integrated with the entity-relationship (ER) model to structure parallel and distributed programs. Such an integration can permit querying as well as application programming in a seamless fashion based on the notion of transactions and provides for heterogeneous processing. We also describe how to design a scheduler for the Gamma paradigm and how this paradigm is useful in heterogeneous programming.
Heterogeneous computing opens up new challenges and opportunities in fields such as parallelprocessing, design of algorithms for applications, partitioning and mapping of parallel tasks, interconnection network techn...
详细信息
Heterogeneous computing opens up new challenges and opportunities in fields such as parallelprocessing, design of algorithms for applications, partitioning and mapping of parallel tasks, interconnection network technology and the design of heterogeneous programming environments. Lots of load balancing algorithms have been proposed and experimented with in the past years for homogeneous parallel and distributed systems. The author presents a priority-based decay usage load balancing algorithm for a heterogeneous computing environment. The algorithm determines the task precedence graph of the parallel jobs dynamically at run-time and assigns appropriate priorities to the processes to resolve the dependencies. The heuristic algorithm has been tested on some heterogeneous program models.
The conventional back-propagation (BP) algorithm is not suitable for building fault tolerant neural networks, since it usually develops nonuniform weights. In this paper, a learning method to improve the fault toleran...
详细信息
ISBN:
(纸本)0780332105
The conventional back-propagation (BP) algorithm is not suitable for building fault tolerant neural networks, since it usually develops nonuniform weights. In this paper, a learning method to improve the fault tolerance in classification is therefore presented and a metric is devised to evaluate the performance. The new method is based on the BP algorithm. During the training, the magnitude of each weight is restrained from over-increasing. This modification enforces that the information be distributed across weights more evenly. Simulation results demonstrate that the modified algorithm leads to significant enhancement in the network's ability to cope with internal hardware failures.
We show an alternative way to optimize join sequences in a shared nothing architecture of the distributed relational DBMS HEAD. The hardware resources are also used for database independent applications in concurrency...
详细信息
We show an alternative way to optimize join sequences in a shared nothing architecture of the distributed relational DBMS HEAD. The hardware resources are also used for database independent applications in concurrency, for database access. To achieve a better hardware utilization we span a complete search space involving all intermediate shapes between left deep, right deep and bushy trees, but without join sequences including cartesian products. The approach is based on any combinatorial search engine and a complex cost function. The cost function involves the actual load of the processors, the network load, and the memory capacities. The new technique has free access to any join sequence in the whole search space. The approach is not restricted to acyclic join conditions.
The Associative Communication network consists of a crossbar switch melted with a distributed associative memory. The network supports the design of scalable multiprocessor systems with low programming effort for comm...
详细信息
暂无评论