this paper deals with a novel communication timing control for wireless networks and radio interference problem. Communication timing control is based on the mutual synchronization of coupled phase oscillatory dynamic...
详细信息
ISBN:
(纸本)9780889866386
this paper deals with a novel communication timing control for wireless networks and radio interference problem. Communication timing control is based on the mutual synchronization of coupled phase oscillatory dynamics with a stochastic adaptation. through local and fully distributed interactions, the coupled phase dynamics self-organizes collision free communication timing. In a wireless communication, the influence of the interference wave causes unexpected collision. therefore, we propose a more effective timing control by selecting the interaction nodes according to received signal strength.
distributed execution of logic programs requires a match of granularity between a program and the distributed multi-processor it runs on to exploit its potential for performance fully. this paper presents methods to c...
详细信息
ISBN:
(纸本)0780350049
distributed execution of logic programs requires a match of granularity between a program and the distributed multi-processor it runs on to exploit its potential for performance fully. this paper presents methods to control the granularity of tasks on distributed heterogeneous processors effectively. It considers the characteristics of such platforms and relates the amount of local computation withthe significant communication overheads by introducing the notion of a collection of parallel tasks. the experimental results indicate that the proposed controls can model all kinds of predicates (reclusive, mutually recursive etc.) satisfactorily and improve the performance of various forms of parallelism (AND, OR, combinations).
this paper studies Strassen's matrix multiplication algorithm by implementing it in a variety of methods: sequential, workflow, and in parallel. All the methods show better performance than the well-known scientif...
详细信息
ISBN:
(纸本)9780889866386
this paper studies Strassen's matrix multiplication algorithm by implementing it in a variety of methods: sequential, workflow, and in parallel. All the methods show better performance than the well-known scientific libraries for medium to large size matrices. the sequential recursive program is implemented and compared with ATLAS's DGEMM subroutine. A workflow program in the NetSolve system and two parallel programs based on MPI and Scal-APACK are also implemented. By analyzing the time complexity and memory requirement of each method, we provide insight into how to utilize Strassen's Algorithm to speedup matrix multiplication based on existing high performance tools or libraries.
the Nile system is a distributed environment for running very large, data-intensive applications across a network of commodity workstations. these applications process data from elementary particle collisions, generat...
详细信息
ISBN:
(纸本)0780350049
the Nile system is a distributed environment for running very large, data-intensive applications across a network of commodity workstations. these applications process data from elementary particle collisions, generated by the Cornell Electron Storage Ring, and are used by physicists of the CLEO experiment. the applications have a simple data-parallel structure, and so Nile executes them using as much parallelism as is available. Nile currently runs at any single site. It is being used by alpha testers and is scheduled for beta release in March 1998. this paper describes how we are adapting this local-area Nile system to allow for wide-area, multiple site interactions. In particular, we consider the two problems of scaling and of fault-tolerance.
Emerging multiple display infrastructures provide users with a large number of semi-public and private displays. Selecting what information to present on which display here becomes a real issue, especially when multip...
详细信息
ISBN:
(纸本)9780889866386
Emerging multiple display infrastructures provide users with a large number of semi-public and private displays. Selecting what information to present on which display here becomes a real issue, especially when multiple users with diverging interests have to be considered. this especially holds for dynamic ensembles of displays. We propose to cast the Display Mapping problem as an optimization task. We develop an explicit criterion for the global quality of a display mapping and then describe a distributed algorithm based on the GRASP framework that is able to approximate the global optimum through local interaction between display devices. We claim that such a distributed optimization approach, based on the definition of an explicit global quality measure, is a general concept for achieving coherent ensemble behavior.
For search-intensive applications such as data mining and bioinformatics, a SIMD Processor Array on a Chip may be an effective architecture, and if the application is control-intensive, a Multiple SIMD (MSIMD) archite...
详细信息
ISBN:
(纸本)9780889866386
For search-intensive applications such as data mining and bioinformatics, a SIMD Processor Array on a Chip may be an effective architecture, and if the application is control-intensive, a Multiple SIMD (MSIMD) architecture may further increase processor utilization. In this paper, we describe the implementation of an associative MSIMD architecture on the MASC Processor. the MASC Processor implemented using FPGAs, is easily scalable, and dynamically assigns tasks to Processing Elements as the program executes.
this paper describes a novel approach to deterministic multithreading for active replication of Java objects. Unlike other existing approaches, the presented deterministic thread scheduler fully supports the native Ja...
详细信息
ISBN:
(纸本)9780889866386
this paper describes a novel approach to deterministic multithreading for active replication of Java objects. Unlike other existing approaches, the presented deterministic thread scheduler fully supports the native Java synchronisation mechanisms, including reentrant locks, condition variables, and time bounds on wait operations. Furthermore, this paper proposes source-code transformation as a novel approach for intercepting Java synchronisation statements. this allows the reuse of existing object implementations and simplifies application development.
Volunteer computing is an innovative approach to high performance computingthat relies on volunteers who donate their personal computers' unused resources to a computationally intensive research project. Prominen...
详细信息
ISBN:
(纸本)9780889866386
Volunteer computing is an innovative approach to high performance computingthat relies on volunteers who donate their personal computers' unused resources to a computationally intensive research project. Prominent volunteer computing projects include SETI@home, Folding@Home, and the Great Internet Mersenne Prime Search (GIMPS). Many volunteer computing projects are built upon a volunteer computing framework that abstracts functionality that is common to all volunteer computing projects, such as network communications, database access, and project management. these volunteer computing frameworks tend to be complex, limiting, and difficult to use. We have designed and implemented a new volunteer computing framework called the Simple Light-weight Infrastructure for Network computing (SLINC) that addresses the disadvantages we identified with existing frameworks. SLINC is a flexible and extensible volunteer computing framework that will enable researchers to more easily build volunteer computing projects.
distributed service architectures are mandatory to handle the platform scale and dynamicity hindering the development of grid and P2P applications. these large-scaled distributed applications are difficult to design, ...
详细信息
ISBN:
(纸本)9780889866386
distributed service architectures are mandatory to handle the platform scale and dynamicity hindering the development of grid and P2P applications. these large-scaled distributed applications are difficult to design, develop and tune because of boththeoretical and practical issues. this paper presents the GRAS framework that allows developers to first implement and experiment with such an infrastructure in simulation, benefiting from a controlled environment. the infrastructure can then be deployed in situ without code modification. We detail our design goals, and contrast them withthe state of the art. We study the exchange of a message (from the Pastry protocol) using either GRAS 0 or several other solutions. We quantify boththe code complexity and the performance and find that GRAS performs better according to both metrics.
this paper research on how to select a subtree with exactly k leaves and a diameter of at most 1, which minimizes the distance from the farthest vertex to the subtree. We call such a subtree (k, l)-center of a tree ne...
详细信息
ISBN:
(纸本)9780889866386
this paper research on how to select a subtree with exactly k leaves and a diameter of at most 1, which minimizes the distance from the farthest vertex to the subtree. We call such a subtree (k, l)-center of a tree network. In this paper, an efficient parallel algorithm is proposed for finding a (k, l)-center of a tree network. this algorithm performs on the EREW PRAM in O(log n) time using O(n) work.
暂无评论