High performance and reliability are critical requirements for real time systems. Efficient scheduling that assigns tasks of an application to suitable processors in these systems is necessary for achieving high perfo...
详细信息
Finding the expectation of the maximum execution time among parallel processors is crucial in parallel performance evaluation. Unfortunately, current analytical methods for maximum mean calculation cannot be applied t...
详细信息
the Multi-Level computing Architecture (MLCA) is a novel parallel System-on-a-Chip architecture targeted for multimedia applications. It features a top level controller that automatically extracts task level paralleli...
详细信息
ISBN:
(纸本)9780889866386
the Multi-Level computing Architecture (MLCA) is a novel parallel System-on-a-Chip architecture targeted for multimedia applications. It features a top level controller that automatically extracts task level parallelism using techniques similar to how instruction level parallelism is extracted by superscalar processors. this allows the MLCA to support a simple programming model that is similar to sequential programming. In order to assist programmers to easily and efficiently port multimedia applications to the MLCA programming model, a compilation environment is designed. this compilation environment enhances parallelism in MLCA programs by applying three simple code transformations that are based on known compiler optimizations. In this paper, we describe the MLCA architecture, its programming model, its compilation environment and an evaluation of its performance. Our experimental evaluation withthree real multimedia applications and an MLCA simulator shows that the MLCA is a viable architecture and scaling speedups can be obtained using the compilation environment with little programmer effort.
this paper presents FastPara, a C++ programming framework and associated runtime support for writing and running data-parallel applications in computer cluster environments. With FastPara, the user writes a declaratio...
详细信息
ISBN:
(纸本)9780889866386
this paper presents FastPara, a C++ programming framework and associated runtime support for writing and running data-parallel applications in computer cluster environments. With FastPara, the user writes a declaration of the data to be exchanged between processes for a certain data-parallel processing algorithm. FastPara will handle all the process communications without any users' efforts. Complex data structures and variable-length arrays are well supported so that users can easily apply this framework to their data-parallel applications. FastPara's runtime provides built-in support for process management and fault tolerance for the parallel processing. FastPara can greatly simplify the development cycle. Based on the performance tests we did, FastPara demonstrated good communication efficiency and little process coordination overhead. We believe that FastPara is a very useful framework in developing data-parallel applications.
parallelcomputing is primarily used in supercomputer environment with many available application tools. Since the early 1990s, there has been an increasing trend to move away from expensive and specialized parallel s...
详细信息
In this paper, we put forward an integrated solution to provide service quality features in an MPLS network, called Integrated, QoS-based Traffic Engineering with Service Restoration (INTESER). INTESER employs a distr...
详细信息
ISBN:
(纸本)9780889866386
In this paper, we put forward an integrated solution to provide service quality features in an MPLS network, called Integrated, QoS-based Traffic Engineering with Service Restoration (INTESER). INTESER employs a distributed multipath forwarding paradigm in an MPLS domain to enable optimal, QoS-aware traffic engineering and service restoration through static call admission control, and dynamic load balancing and rate adaptation at the domain edge. the core nodes can be QoS agnostic and use a single FIFO queue at each output port. Preliminary simulation results demonstrate the promising prospective of the proposed solution as a simpler and more scalable alternative to the existing solutions.
Microarray experiments generate a plethora of genomic data;therefore, we need techniques and architectures to analyze this data more quickly. the paper presents a solution for reducing the computation time of one of t...
详细信息
Group mutual exclusion is a naturel problem, formulated by Joung, that generalize the classical mutual exclusion problem. In group mutual exclusion a process requests a"session" before entering its critical ...
详细信息
distributed object-oriented middleware technologies have been adopted for ubiquitous communicating real-time and embedded systems. Although Java plays an important role in building distributed object-oriented middlewa...
详细信息
ISBN:
(纸本)9780889866386
distributed object-oriented middleware technologies have been adopted for ubiquitous communicating real-time and embedded systems. Although Java plays an important role in building distributed object-oriented middleware because of its portability and productivity, it is not popularto real-time system developers because it is slow and hard to keep real-timeness due to garbage collection. this paper presents a novel memory classification and measurement approach for modem programming language such as Java to analyze the memory utilization of middleware technologies in order to improve them for embedded systems using limited computing resource. We classified Java memory into four categories such as static, quasi-static, quasi-dynamic and dynamic, and show how to measure the size of each memory. Intensive case studies using popular Java middleware technologies such as Web Services, CORBA, RMI and HORB revealed that reducing the use of dynamic memory has contributed far more to the efficiency and performance than reducing the use of quasi-static and quasi-dynamic memory.
We describe a highly scalable algorithm for secure system evolution in an infrastructure for widely distributed Byzantine fault-tolerant applications. To maintain high availability, the system and its applications evo...
详细信息
ISBN:
(纸本)9780889866386
We describe a highly scalable algorithm for secure system evolution in an infrastructure for widely distributed Byzantine fault-tolerant applications. To maintain high availability, the system and its applications evolve on-line, providing uninterrupted service during installation of upgrades. Installations are made to appear atomic with respect to other installations and application execution steps. Our algorithm guarantees safe installation despite Byzantine faulty replicas and replica groups. An initial phase prepares replica groups for an upgrade, while a second phase triggers the installation of the upgrade by gossip among groups. A simple but novel scheme using secret sharing and Byzantine quorums prevents faulty replicas and replica groups from disrupting or maliciously exploiting installations. Installation message complexity and computational complexity grow linearly withthe number of replicas.
暂无评论