Congestion in interconnection networks due to the presence of hot spots is an important and difficult problem that occurs in parallel machines. This problem has been studied in depth and different solutions for the ca...
详细信息
Congestion in interconnection networks due to the presence of hot spots is an important and difficult problem that occurs in parallel machines. This problem has been studied in depth and different solutions for the case of multiprocessors with shared memory have been proposed. Current trends point towards the implementation of systems with physically distributed memory, either based on, message passing (multicomputers) or on a single shared memory address space (multiprocessors). Our paper is developed in this context. Up to now, proposals to improve the throughput of networks with hot-spots have focused on using virtual channels or adaptive algorithms. We present a novel solution based on reconfigurable networks. A reconfigurable network is one in which nodes can change their position depending on the communication pattern in order to diminish the congestion produced in the network and, therefore, increase its throughput. We studied this problem in two-dimensional k-ary n-cube networks using a deterministic routing algorithm and wormhole routing. In this paper the main features of a reconfigurable network are presented and the results obtained by simulation are shown. These results confirm that this technique is a very interesting one for systems with distributed memory, with applications to a great variety of problems.
The paper presents an alternative approach to the formal specification and validation of distributed asynchronous algorithms. It begins with a syntactically correct description of the algorithm whose correctness is th...
详细信息
The paper presents an alternative approach to the formal specification and validation of distributed asynchronous algorithms. It begins with a syntactically correct description of the algorithm whose correctness is then to be validated. The validation of the algorithm is based on the process-oriented discrete simulation and permits a partial correctness validation of the algorithm implemented by a program. The suggested method enables to model independent activity of several processors (using pseudo-parallel processes) in simulation time and to model communication channels with defined time behavior and failure semantics. Using the approach it is easy to add other processes like model of system's environment, fault injector and state observer. The method is described with the aid of a simple C-based validation tool called C-Sim. The utilization of C-Sim requires only slight changes in C-coded implementation of the verified algorithm. An example of validation of distributed election algorithm with the presence of faults is presented.
A consistency control algorithm for replicated data objects in distributed computing systems, called RVC2, has been extensively analyzed. RVC2 is a voting-based algorithm which utilizes a selective regeneration and re...
详细信息
A consistency control algorithm for replicated data objects in distributed computing systems, called RVC2, has been extensively analyzed. RVC2 is a voting-based algorithm which utilizes a selective regeneration and recovery mechanism for failed copies of data objects. Virtual copies, which record information about the current state of a copy, but which contain no actual data, are used in addition to real copies to reduce network and storage overhead. Empirical results concerning availability, obtained through simulation, are presented. These results show that varying the number of real versus virtual copies, and varying the generation threshold, has no significant impact on availability. The results also suggest that RVC2 is an unnecessarily complex algorithm because regeneration has no significant impact on availability under most circumstances.
parallel and distributed computer architectures are increasingly being considered for application in a wide variety of computationally intensive embedded systems. Many such applications impose highly dynamic demands f...
详细信息
parallel and distributed computer architectures are increasingly being considered for application in a wide variety of computationally intensive embedded systems. Many such applications impose highly dynamic demands for resources (processors, memory, and communication network), because their computations are data-dependent, or because the applications must constantly interact with a rapidly changing physical environment, or because the applications themselves are adaptive. This paper presents a set of dynamic resource allocation techniques aimed at maintaining high levels of application performance in the presence of varying resource demands. It focuses on a class of applications structured as multiple pipelines of data-parallel stages, as this structure is common to many sensor-based applications. We discuss the issues involved in resource management for such applications, and present preliminary results from our implementations on Intel Paragon. Our approach uses feedback control - a real-time monitoring system is used to detect significant performance shortfalls, and resources are reallocated among the application components in an attempt to improve performance. The main contribution of this work is that it combines real-time monitoring of an application's performance with dynamic resource allocation, and focuses on practical implementations rather than simulation and analysis.
We present a uniform construct of parallel programming for a set of image processing tasks based on our distributed computing primitive (DCP) concept. Our target architecture is a heterogeneous computing network syste...
详细信息
We present a uniform construct of parallel programming for a set of image processing tasks based on our distributed computing primitive (DCP) concept. Our target architecture is a heterogeneous computing network system consisting of various high performance workstations connected through a local area network. We show that DCP has advantages over non-primitive PVM-basedparallel approaches in three aspects: ease-of-use, automation, and optimization.
Integrating parallel functions into the manipulation of persistent objects on a network-based shared memory architecture is a proposal under consideration. The cost associated with manipulating a large amount of distr...
详细信息
Integrating parallel functions into the manipulation of persistent objects on a network-based shared memory architecture is a proposal under consideration. The cost associated with manipulating a large amount of distributed persistent objects is expected to improve from sequential to parallelprocessing. However, it is a complex task to combine persistence with the capability of parallel and distributedprocessing. We put forward the design and implementation methods concerning this. based on a C++ based language called INADA, in which functions for handling persistent objects are introduced, we present a language construct for accessing distributed persistent objects in parallel, and a new approach for supporting transparent parallel and distributedprocessing. The transparency assures that distributed persistent objects are manipulated in parallel on multiple threads of remote computers as if they were manipulated in a local multiprocessor machine. A key point of this proposal is that we have made a combination of persistence, multithread primitives, network-based shared-memory, and the agent-oriented paradigm.
The proceedings contain 33 papers. The topics discussed include: parallel simulation of freeway traffic flows on a personal computer-baseddistributed computing system;determination of traffic characteristics using fu...
The proceedings contain 33 papers. The topics discussed include: parallel simulation of freeway traffic flows on a personal computer-baseddistributed computing system;determination of traffic characteristics using fuzzy logic;evaluation of measured travel time utilizing two-way communication in UTMS;development of a portable traffic flow measurement system using image processing;solving the bottleneck problem at automated highway exits;collision analysis of vehicle following operations in automated highway systems;magnetically levitated shuttle highway system;neural network techniques for multistatic hyperbolic vehicle positioning;minimal reliability requirements on automated vehicles for a safe and reasonably efficient AHS;Gary-Chicago-Milwaukee ITS priority corridor program plan;and a comparison of international ITS service architectures and demand forecasting of the Korean ITS service.
Neural networks have been widely used in a large area of applications, like image processing, learning processes, identification and control, etc. but there is a lack for their use for approximate solving real-time sc...
详细信息
Neural networks have been widely used in a large area of applications, like image processing, learning processes, identification and control, etc. but there is a lack for their use for approximate solving real-time scheduling problems. The authors have already shown the ability of a neural networkbased scheduling algorithm to deal with the scheduling of independent real-time tasks in a multiprocessor environment. The algorithm is approximate but has a remarkable convergence speed due to the highly parallel nature of the search. In recent literature, the authors have analyzed the performance of the algorithm when compared with the well-known rare monotonic and earliest deadline algorithms for the monoprocessor case. In this paper we present an analysis of the quality of the yielded solution for the multiprocessor case.
A different approach to addressing on a CDMA (code division multiple access) fiber based LAN (local area network) is investigated. This change serves to enable a network with unusual properties: specifically this impl...
详细信息
A different approach to addressing on a CDMA (code division multiple access) fiber based LAN (local area network) is investigated. This change serves to enable a network with unusual properties: specifically this implementation modification enables a network that provides: immediate and simultaneous access to all users (real-time); arbitrary length transmissions (including continuous); all data available to all nodes; support of sensor type nodes (no receive or monitor capability). The technique is discussed and a theoretical use of this technique to allow a fully dynamically reconfigurable parallel multiprocessor is presented.
We consider the message routing/broadcasting problem in an optically interconnected massively parallelprocessing system, where each node in the system sends/broadcasts randomly generated packets to others. The networ...
详细信息
We consider the message routing/broadcasting problem in an optically interconnected massively parallelprocessing system, where each node in the system sends/broadcasts randomly generated packets to others. The network model considered is the reconfigurable optical interconnect (ROI). It is based on the new device capabilities enabled by recent advances in optical technology. A ROI node can use light beams to transmit messages to any other nodes in the network, provided that no others transmit to the same destination concurrently. We present communication schemes that can achieve near optimal throughput with significantly lower delay. The difference in performance for routing is on the order of /spl Omega/(n/sup 2/3/ log log n/log n) when the number of nodes n in the network is large.
暂无评论