In this paper, we suggest a new object-oriented functional language, OOId, which is based on a functional language fd and extended with object-oriented language features. We also discuss how to map OOId program onto D...
详细信息
ISBN:
(纸本)0818682272
In this paper, we suggest a new object-oriented functional language, OOId, which is based on a functional language fd and extended with object-oriented language features. We also discuss how to map OOId program onto DAVRID, which is a kind of multithreaded architecture based on the dataflow model. The comparison of execution time of two programs written in fd and OOId for the matrix multiplication problem, shows we can effectively run OOId program with just a little slow-down of execution time. In addition, the rate of stow-down is decreased, as the size of the matrix is larger. That means we can use good features od object-oriented language by paying just a little slow-down of execution time.
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 parallel processing and distributedcomputing 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 parallel processing 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.
Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmabil...
详细信息
ISBN:
(纸本)0818678135
Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmability of such systems, by providing globally accessible 'object' abstractions, Researchers have developed consistency protocols for replicated 'memory' objects. These protocols are well suited to scientific applications but less suited to multimedia or groupware applications. This paper addresses the state sharing needs of complex distributed applications with (1) high-frequency symmetric accesses to shared objects, (2) unpredictable and limited locality of accesses, (3) dynamically changing sharing behavior, and (4) potential data races. We show that a DSO system exploiting application-level temporal and spatial constraints an shared objects can outperform shared object protocols which do not exploit application-level constraints. We compare our S(emantic) DSO against entry consistency using a sample application having the four properties mentioned above.
An optimal parallel algorithm for computing all-pair shortest paths on doubly convex bipartite graphs is presented here. Our parallel algorithm runs in O(logn) time with O(n(2)/logn) processors on an EREW PRAM and is ...
详细信息
ISBN:
(纸本)0818682272
An optimal parallel algorithm for computing all-pair shortest paths on doubly convex bipartite graphs is presented here. Our parallel algorithm runs in O(logn) time with O(n(2)/logn) processors on an EREW PRAM and is time-and-work-optimal. As a by-product, we show that the problem can be solved by a sequential algorithm in O(n(2)) time optimally on any adjacency list or matrix representing a doubly convex bipartite graph. The result in this paper improves a recent work on the problem for bipartite permutation graphs, which are properly contained in doubly convex bipartite graphs.
Frameworks for parallelcomputing have recently become popular as a means for preserving parallel algorithms as reusable components. Framework for parallelcomputing in general, and POET in particular, focus on findin...
详细信息
ISBN:
(纸本)0818677430
Frameworks for parallelcomputing have recently become popular as a means for preserving parallel algorithms as reusable components. Framework for parallelcomputing in general, and POET in particular, focus on finding ways to orchestrate cooperation between objects implementing parallel algorithms. POET seeks to be a general platform for scientific parallel algorithm components which can be modified, linked "mixed and matched" to a user's specification. The paper centers on the characteristics that allow these components to cooperate, and at the same time, remain "black-boxes" that users can drop into the frame without having to know the exquisite details of message-passing, data layout, etc.
distributed Shared Memory (DSM) offers programmers a shared memory abstraction on top of an underlying network of distributed memory machines. advances in network technology and price/performance of workstations sugge...
详细信息
distributed Shared Memory (DSM) offers programmers a shared memory abstraction on top of an underlying network of distributed memory machines. advances in network technology and price/performance of workstations suggest that DSM will be the dominant paradigm for future high-performance computing. However, as long running DSM applications scale to hundreds or even thousands of machines, the probability of a node or network link failing increases. Fault tolerance is typically achieved via `checkpointing' techniques that allow applications to `roll back' to a recent checkpoint rather than restarting. High-performance DSM systems using relaxed memory consistency are significantly more difficult to checkpoint than uniprocessor or message passing architectures. This paper describes previous approaches to checkpointing message passing parallel programs along with extensions to DSM systems.
The C* language is a data-parallel extension of the C language which incorporates parallel data types. Since the C++ language provides operator overloading, a C++ library can implement the C* parallel extensions with ...
详细信息
ISBN:
(纸本)0818678763
The C* language is a data-parallel extension of the C language which incorporates parallel data types. Since the C++ language provides operator overloading, a C++ library can implement the C* parallel extensions with a similar syntax. Although library implementations are highly portable, some overheads make them impractical. The two major overheads incurred are temporaries in each operator application, and the inability to detect regular communication patterns The C++ overloading mechanism forces a temporary for each operator application. Also, regular communications in. C* are syntactically indistinguishable from general point-to-point communications. We tackled these problems extensively in a library. The template mechanism, a type parameterization in C++, is used to eliminate temporaries by delaying operator application and evaluating the entire expression at once. The polymorphic type dispatch mechanism is used to detect regular communications by assigning particular types to potentially regular communications. We have implemented the library on the CM-5, and compared its performance with the C* compiler using three simple examples. The techniques presented offers improved performance comparable to the C* compiler, which is close or 1.5 times slower in two examples, and even faster in one example.
Analyzing large data sets is gaining more importance because of its wide variety of applications in parallel and distributed environment. Hadoop environment gives more flexibility to programmers in parallelcomputing....
详细信息
ISBN:
(纸本)9789811031564;9789811031557
Analyzing large data sets is gaining more importance because of its wide variety of applications in parallel and distributed environment. Hadoop environment gives more flexibility to programmers in parallelcomputing. One of the advantages of Hadoop is query evaluation over large datasets. Join operations in query evaluation plays a major role over the large data. This paper Ferret outs the earlier solutions, prolongs them and recommends a new approach for the implementation of joins in Hadoop.
We present the design, implementation and deployment of SPIDO2, a massively parallel out-Of-Core direct dense linear solver used by Boundary Element Method (BEM) codes developed at EADS InnovationWorks, and currently ...
详细信息
ISBN:
(纸本)9781905088423
We present the design, implementation and deployment of SPIDO2, a massively parallel out-Of-Core direct dense linear solver used by Boundary Element Method (BEM) codes developed at EADS InnovationWorks, and currently in production in all EADS business units. It is designed as a high performance drop-in replacement for a legacy solver, uniformly achieves very good scalability up to several hundreds cores (>= 80% of peak performance), is portable and takes into account the new context of HPC, leveraging OpenMP and MPI for intra/inter-node parallelism. We provide here a detailed analysis of the algorithms and data structures used to achieve a very efficient out-of-core parallel decomposition (LU and LDLt), including run-time complexity validating the design choices. We then describe the implementation, benchmarks and validation methodology that led to the deployment of this solver in the BEM codes, and we finally provide insights on how we expect this design to be well-suited to the current and future advances in HPC technology.
distributedcomputing provides a cost-effective solution for computation intensive problems. With the emerging of networking operating system for personal computer (PC), such as WindowsNT, it is now feasible to develo...
详细信息
ISBN:
(纸本)0819425885
distributedcomputing provides a cost-effective solution for computation intensive problems. With the emerging of networking operating system for personal computer (PC), such as WindowsNT, it is now feasible to develop distributedcomputing on a network of PCs. In addition, the computing power delivered by a PC is kept increasing whilst the cost is decreasing. Implying that the performance/cost factor for a PC is high and tile computing power delivered by the network is enormous. In this paper, we describe a software system which enables users to develop distributedcomputing program using the SPMD (Single Program Multiple Data) paradigm very quickly under the WindowsNT operating system. The programming model for the system is simple and a user can control the system through a graphical interface. The results show that our system provides a reasonable speedup in solving Image processing problems.
暂无评论