Multiprocessor architectures are becoming more attractive for embedded systems, and also for multimedia embedded systems. In multimedia embedded systems, there exist both hard real-time tasks and multimedia stream wit...
详细信息
In this paper we describe load scheduling, a novel method that balances load among register files by residual resources. Load scheduling can reduce register pressure for clustered VLIW processors with distributed regi...
详细信息
The paper presents the ongoing work of studying FMEA method for embedded safety critical software via formal analysis of various dependence relations among software elements, which can fairly improve the automation an...
详细信息
ISBN:
(纸本)9780769532622
The paper presents the ongoing work of studying FMEA method for embedded safety critical software via formal analysis of various dependence relations among software elements, which can fairly improve the automation and precision of both system level and detailed level FMEA. These dependence relations are depicted by the formal models abstracted from software design and implementation, and the FMEA processes for both structural and object-oriented software are proposed respectively. The initial result of case study shows the effectiveness of the approach. I 2008 IEEE.
Rate Adaptation (RA) is a mechanism to choose transmission rate based on the dynamic channel quality in wireless networks. The adaptation algorithm run solely at the sender side in 802.11 networks is studied. The key ...
详细信息
Current high performance computing systems all rely on parallelprocessing techniques to achieve high performance. With the parallel computer systems scaling up, the new generation of high performance computers puts m...
详细信息
ISBN:
(纸本)9781605580777
Current high performance computing systems all rely on parallelprocessing techniques to achieve high performance. With the parallel computer systems scaling up, the new generation of high performance computers puts more emphasis on "high productivity" [1], rather than "high performance" as in the past. These new systems will not only meet the traditional requirements of computing performance, but also address the ongoing technical challenges in the current high-end computing domain regarding energy consumption, reliability, etc. For energy consumption, with the computer system scaling up, it increases dramatically [2]. High energy consumption means high maintenance cost and low system stability. For example, the peak energy consumption of the Earth Simulator and BlueGene/L is 18MW and 1.6MW respectively. For reliability, with the complexity of a computer system increasing, its meantimebetween-failure (MTBF) is becoming significantly shorter than what is required by many current high performance computing applications [3], such as BlueGene/L. Therefore, energy optimization techniques and fault tolerance techniques should be introduced to computer systems to achieve low energy consumption and high reliability. To improve the productivity of high performance computing systems, we need to find a proper way to measure it. Unfortunately, traditional measurement models can not evaluate the system productivity comprehensively and effectively [4]. To address this issue, this paper proposes an effective scalability metric for high performance computing systems based on Gustafson speedup law. The metric makes a good balance among runtime productivity factors including computing performance, energy consumption and reliability. The contribution of our work lies in the following three aspects. First, in order to measure the scalability of an energyconsumption optimized parallel program, we should consider not only whether the program computing performance is scalable, but also w
In this paper, we propose an example-based decoder for a statistical machine translation (SMT) system, which is used for spoken language machine translation. In this way, it will help to solve the re-ordering problem ...
详细信息
This paper presents a search algorithm called probabilistic search team (PST). In PST, all nodes advertise their resource sharing information, maintain and broadcast the information based on DDBF (distributed discardi...
详细信息
This paper presents a search algorithm called probabilistic search team (PST). In PST, all nodes advertise their resource sharing information, maintain and broadcast the information based on DDBF (distributed discarding bloom filter), which discards some information when transmitted to their neighbors. During the search process, PST extends the concept of walker in RW to search team. PST realizes collaborative and parallel search of multiple search teams by aggregating the resource information obtained in search process. Experimental results show that PST achieves a good tradeoff between performance and overhead.
Internet resources have the natural characteristics of growth, autonomy and diversity, which have brought great challenges to the efficient aggregation of these resources. Utilizing overlay to organize resources and s...
详细信息
Internet resources have the natural characteristics of growth, autonomy and diversity, which have brought great challenges to the efficient aggregation of these resources. Utilizing overlay to organize resources and support efficient resource discovery is an important approach to aggregate resources on-demand in Internet-based Virtual Computing Environment (iVCE). This paper gives an overview of research advances on overlay technologies in iVCE. To adapt to the growth and autonomy of Internet resources, an overlay topology construction mechanism based on Kautz graph is first introduced, and it is extended to a universal method for constructing overlay topologies based on arbitrary regular graphs. To adapt to the diversity of Internet resources, a grouped overlay topology construction mechanism is then proposed. Based on the overlay constructed above, an efficient range query scheme is presented, and the optimization methods of overlay topology as well as other complex query techniques are discussed.
Peer-to-Peer (P2P) computing systems are rapidly growing in importance as the medium of choice for the mass storage. Peers in the most P2P systems randomly choose logical neighbors without any knowledge about underlyi...
详细信息
This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit...
详细信息
This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit of data management. Updates are compressed by Bloom filter technique and propagated in double-path. Negotiation algorithms detect and reconcile update conflicts, and dynamic data management algorithms accommodate dynamic data processing. The results of the performance evaluation show that it is an efficient method to achieve consistency, good dynamic property, and strong robustness when choosing the size of data block appropriately. At the same time, a feasible way is put forward on how to choose appropriate data block size.
暂无评论