this paper presents an automated system-level co-design tool for hard real-time distributed embedded systems. the tool generates energy-efficient implementation alternatives from a high-level system description. the o...
详细信息
ISBN:
(纸本)0780390296
this paper presents an automated system-level co-design tool for hard real-time distributed embedded systems. the tool generates energy-efficient implementation alternatives from a high-level system description. the obtained implementation alternatives span the whole Pareto-optimal front and hence offer the designer enough freedom in choosing a design alternative based on market requirements. Energy-efficient computing is achieved by applying voltage scaling (VS) to exploit slack periods in the system based on a global view of energy profiles of all tasks and their mappings. the co-synthesis process is enhanced in this paper by an extra allocation refinement step to prevent unnecessary energy dissipation and to enhance the efficiency of VS schemes. the time schedule of tasks is also optimized to maximize the energy reduction achieved by apply VS.
this paper is concerned withthe realization of the parallel computer chess application. the asynchronous parallel search algorithm uses distributed local network. the original solution is implemented and tested in au...
详细信息
ISBN:
(纸本)0780391640
this paper is concerned withthe realization of the parallel computer chess application. the asynchronous parallel search algorithm uses distributed local network. the original solution is implemented and tested in author's chess application Axon. the standard approaches of parallelism use dual and quad server PC machine, which is expensive and rare compared with classical single processor PC machines. the author's solution introduces a new class of simple and efficient algorithm of the parallelization, using standard single processor units connected via local 100 Mb or 1 Gbit networks. Compared with single processor search algorithms, the parallel algorithm significantly increases performance in test suites and practical play.
this paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination Programming to derive a framework for distributed Multimedia Systems based on asynchronous timed computations ...
详细信息
this paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination Programming to derive a framework for distributed Multimedia Systems based on asynchronous timed computations expressed in a certain coordination formalism. More to the point, we propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). the real-time extensions that have been proposed for the concurrent constraint programming framework are coupled withthe object-oriented and inheritance mechanisms that have been developed for logic programs yielding an integrated declarative environment for multimedia objects modelling, composition and synchronisation. Furthermore, we show how the framework can be implemented in the general-purpose coordination language MANIFOLD without the need for using special architectures or real-time languages. (c) 2004 Elsevier B.V. All rights reserved.
Dixon Resultant method can eliminate many variables simultaneously. It is often used to solve a system of polynomial equations. However, the Dixon matrix is often singular, and the Dixon Resultant vanishes identically...
详细信息
Network intrusion-detection systems are now being identified as a mandatory component in multilayered security architecture. Intrusion detection systems have traditionally been based on the characterization of a user ...
详细信息
With relations growing larger, distributed, and queries becoming more complex, parallel query processing is an increasingly attractive option for improving the performance of database systems. distributed and parallel...
详细信息
ISBN:
(纸本)9728865198
With relations growing larger, distributed, and queries becoming more complex, parallel query processing is an increasingly attractive option for improving the performance of database systems. distributed and parallel query processing has been widely used in data intensive applications where data of relevance to users are stored at multiple locations. In this paper, we propose a three-tier middleware system for optimizing and processing of distributed queries in parallel on Cluster Grid architecture. the main contribution of this paper is providing transparent and integrated access to distributed heterogeneous data resources, getting performance improvements of implicit parallelism by extending technologies from parallel databases. We also proposed the dynamic programming algorithm for query optimization and site selection algorithm for resource balancing. An example query for employee databases is used throughout the paper to show the benefits of the system.
Many image processing algorithms have a very high execution time if only a processor is used for processing them. Using a SIMD parallel structure for its execution could reduce this time. this is particularly importan...
详细信息
ISBN:
(纸本)0769522556
Many image processing algorithms have a very high execution time if only a processor is used for processing them. Using a SIMD parallel structure for its execution could reduce this time. this is particularly important in the case of algorithms that must be processed in real time. the use of networks of PCs is an appealing solution that besides its low cost, takes advantage from both, the high speed of actual interconnection networks, and the high-performance of PCs. In this paper we present a model that explicitly considers system parameters, network parameters, and application parameters. So, the speed and communication model of the considered network, the workstations and PCs computing power, the per-pixel computational cost of the algorithms (that can be constant or variable), and a variable number of computers have been considered.
Sensor networks are increasingly being used for applications which require fast processing of data, such as multimedia processing. distributedcomputing can be used on a sensor network to reduce the completion time of...
详细信息
Open MPI is a project recently initiated to provide a fault-tolerant, multi-network capable implementation of MPI-2 [16], based on experiences gained from FT-MP1 [7], LA-MPI [10], LAM/MPI [23], and MVAPICH [18] projec...
详细信息
ISBN:
(纸本)0769523129
Open MPI is a project recently initiated to provide a fault-tolerant, multi-network capable implementation of MPI-2 [16], based on experiences gained from FT-MP1 [7], LA-MPI [10], LAM/MPI [23], and MVAPICH [18] projects. Its initial communication architecture is layered on top of TCP/IP. In this paper, we have designed and implemented Open MPI point-to-point layer on top of a high-end interconnect, Quadrics/Elan4 [21]. the restriction of Quadrics static process model has been overcome to accommodate the requirement of MPI-2 dynamic process management. Quadrics Queued-based Direct Memory Access (QDMA) and Remote Direct Memory Access (RDMA) mechanisms have been integrated to form a low-overhead, high-performance transport layer. Light-weight asynchronous progress is made possible with a combination of Quadrics chained event and QDMA mechanisms. Experimental results indicate that the resulting point-to-point transport layer is able to achieve comparable performance to Quadrics native QDMA operations, from which it is derived. Our implementation provides an MPI-2 compliant message passing library over Quadrics/Elan4 with a performance comparable to MPICH-Quadrics.
A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural operational semantics. this approach investi...
详细信息
暂无评论