One of the most exciting and challenging research areas in our modern world involves the design and implementation of intelligent agents. In this paper we outline the specifications for applying recent advances in par...
详细信息
ISBN:
(纸本)1932415262
One of the most exciting and challenging research areas in our modern world involves the design and implementation of intelligent agents. In this paper we outline the specifications for applying recent advances in parallelprocessing and distributed computing technology to the design and analysis of parallel algorithms associated with the creation of the clusters necessary for the efficient operation of distributed intelligent agents. Intelligent agents, whose application spans the spectrum from internal combustion engines to remote robotic control, must be able to make decisions, act autonomously, and exhibit real time behavior in a potentially hostile environment. Recent advances in parallelprocessing including fault tolerance in programming languages provides an arena in which to explore and apply this technology to the construction of robotic systems that exhibit decision making capability and respond in real time.
The simplex algorithm for linear programming has two major variants: the original, or standard method, and the revised method. Today, virtually all serious implementations are based on the revised method because it is...
详细信息
ISBN:
(纸本)1932415262
The simplex algorithm for linear programming has two major variants: the original, or standard method, and the revised method. Today, virtually all serious implementations are based on the revised method because it is much faster for sparse LPs, which are most common. However, the standard method has advantages as well. First, the standard method is effective for dense problems. While dense problems are uncommon in general, they occur frequently in some important applications such as wavelet decomposition, digital filter design, text categorization, and image processing. Second, the standard method can be easily and effectively extended to a coarse grained, distributed algorithm. We look at distributed linear programming especially optimized for loosely coupled workstations.
We present an algorithm for parallel solving of nonlinear systems in a real time environment. The current implementation uses Real Time Linux (RTLinux) and is independent on the numerical method used for solving the s...
详细信息
ISBN:
(纸本)1892512459
We present an algorithm for parallel solving of nonlinear systems in a real time environment. The current implementation uses Real Time Linux (RTLinux) and is independent on the numerical method used for solving the system. Experimental tests show that the algorithm is up to ten times faster than the same parallel algorithm run in a normal environment.
distributed Systems suffer from the enormous performance gap between local and remote operation. To bridge this gap a general purpose distributed operating system must provide a variety of techniques for a single purp...
详细信息
ISBN:
(纸本)1892512459
distributed Systems suffer from the enormous performance gap between local and remote operation. To bridge this gap a general purpose distributed operating system must provide a variety of techniques for a single purpose, such as both RPC and replication, for remote data access. Depending on the situation the OS has to select the most suitable technique dynamically. But the indirections needed for dynamic switching between different techniques must be as efficient as possible to avoid constant overhead. In this paper, we describe the design and implementation of the highly flexible linker FLink that allows the OS to switch between different techniques at runtime without constant overhead.
To efficiently discover motifs in amino acid sequences, a high-speed frequent pattern extraction algorithm is required. This paper presents a dynamic load balancing for the parallelprocessing of Modified PrefixSpan t...
详细信息
ISBN:
(纸本)1932415262
To efficiently discover motifs in amino acid sequences, a high-speed frequent pattern extraction algorithm is required. This paper presents a dynamic load balancing for the parallelprocessing of Modified PrefixSpan to extract frequent patterns from the amino acid sequences on a PC cluster. The parallel Modified PrefixSpan exploits a task-based parallelism that distributes tasks among the computers on the PC cluster. We present a dynamic load balancing methodology called mastertask-steal. The master- task- steal- based dynamic load balancing minimizes idle time when the distributed workload is unbalanced on the PC cluster.
The Adaptive Mesh Refinement is one of the main techniques used for the solution of Partial Differential Equations. Since 3-dimensional structures are more complex, there are few refinement methods especially for para...
详细信息
ISBN:
(纸本)0769526373
The Adaptive Mesh Refinement is one of the main techniques used for the solution of Partial Differential Equations. Since 3-dimensional structures are more complex, there are few refinement methods especially for parallel environments. On the other hand, many algorithms have been proposed for 2-dimensional structures. We analyzed the Rivara's longest-edge bisection algorithm, studied parallelization techniques for the problem, and presented a parallel methodology for the refinement of non-uniform tetrahedral meshes. The main goal of this research is to propose a practical refinement framework for real-life applications. We describe a usable data structure for distributed environments and present a utility capable of distributing the mesh data among processors to solve large mesh structures.
Service descriptions based on type hierachies and abstract service states ruling the availability of operations permit more secure service combinations in distributed systems design than traditional signatures. The ad...
详细信息
ISBN:
(纸本)1932415262
Service descriptions based on type hierachies and abstract service states ruling the availability of operations permit more secure service combinations in distributed systems design than traditional signatures. The advantages of these additional information about services can also be utilized to make service scheduling more robust and efficient. A framework for scheduling such services is introduced and the central techniques used to provide a portable Java-based scheduling framework are discussed.
NOWs are a low-cost and widespread platform for parallel computing. This paper focuses on the dynamic task scheduling problem in NOW environments. The aim is to to minimize the completion time of parallel programs by ...
详细信息
ISBN:
(纸本)1892512459
NOWs are a low-cost and widespread platform for parallel computing. This paper focuses on the dynamic task scheduling problem in NOW environments. The aim is to to minimize the completion time of parallel programs by distributing cooperating concurrent tasks to homogeneous networked nodes dynamically. Cooperation dependencies as well as creation and termination dependencies between task are taken into account. An event lattice model is introduced to describe past, actual and future behavior of a parallel program in execution. Based on this model an algorithm is presented to dynamically assign tasks to the nodes of a distributed system. Crucial for the efficiency of this approach is a top-down construction of all operating system entities involved in distributed resource management, particularly the close co-operation of the compiler and runtime system which allows the creation of event lattice clippings at runtime.
A reconfigurable network termed as the reconfigurable multi-ring network (RMRN) is described. The RMRN is shown to be a truly scalable network in that each node in the network has a fixed degree of connectivity and th...
详细信息
A reconfigurable network termed as the reconfigurable multi-ring network (RMRN) is described. The RMRN is shown to be a truly scalable network in that each node in the network has a fixed degree of connectivity and the reconfiguration mechanism ensures a network diameter of O(log(2) N) for an N-processor network. Algorithms for the two-dimensional mesh and the SIMD or SPMD n-cube are shown to map very elegantly onto the RMRN. Basic message passing and reconfiguration primitives for the SIMD/SPMD RMRN are designed for use as building blocks for more complex parallel algorithms. The RMRN is shown to be a viable architecture for image processing and computer vision problems using the parallel computation of the stereocorrelation imaging operation as an example. Stereocorrelation is one of the most computationally intensive imaging tasks. It is used as a visualization tool in many applications, including remote sensing, geographic information systems and robot vision.
This paper takes a look at the role of location in distributed, Internet-based applications, and identifies three major issues that we believe hold the key to interoperability between components of location-based serv...
详细信息
ISBN:
(纸本)1892512459
This paper takes a look at the role of location in distributed, Internet-based applications, and identifies three major issues that we believe hold the key to interoperability between components of location-based services, namely exposing location-based data and GIS operations efficiently, creating searching mechanisms based on spatial semantics, and providing a simple mechanism for content developers to create and deliver new location services.
暂无评论