Many approaches have been proposed to improve efficiency of interrupt handling, most of which aim at single processor systems. Traditional model of interrupt management has been used for several decades in parallel co...
详细信息
ISBN:
(纸本)9783540729044
Many approaches have been proposed to improve efficiency of interrupt handling, most of which aim at single processor systems. Traditional model of interrupt management has been used for several decades in parallel computing environment. It can work well in most occasions, even in real-time environments. But it is often incapable to incorporate reliability and the temporal predictability demanded on hard real-time systems. Many solutions, such as In-line interrupt handling and Predictable interrupt management, all have special applying fields. In this paper we propose an algorithm that could schedule interrupts in terms of their deadlines for multiprocessor systems. Hard priorities of IRQs are still left to hardware, we only manager those who can get noticed by the kernel. Each interrupt will be scheduled only before its first execution according to their arrival time and deadlines so that it is called lazy Earliest-Deadline-First algorithm. the scheme tries to make as many as possible ISRs finish their work within the time limit. Finally we did some experiments using task simulation, which proved there was a big improvement in interrupts management.
In this paper a novel energy efficient algorithm based on relevant node selection is proposed to deal with a new kind of approximate query, named node number constraint query, for wireless sensor networks. the query p...
详细信息
ISBN:
(纸本)0769529097
In this paper a novel energy efficient algorithm based on relevant node selection is proposed to deal with a new kind of approximate query, named node number constraint query, for wireless sensor networks. the query processing algorithm is composed of three parts: relevant node selection algorithm, energy efficient query dissemination and result collection algorithm. According to the user's precision request, our algorithm selects a part of nodes to answer the user's query then sends query and collects result in an energy efficient way. Simulation results show that the query processing algorithm based on relevant node selection can not only guarantee the precision of the result but also save much more energy than other algorithms.
A difference scheme for noise removal based on four-order partial differential equations is suggested. It can approximate actual image while preserving edges and avoiding blocky effects in image processing. Numerical ...
详细信息
ISBN:
(纸本)0769529097
A difference scheme for noise removal based on four-order partial differential equations is suggested. It can approximate actual image while preserving edges and avoiding blocky effects in image processing. Numerical results are demonstrated its efficiency and the better choice of parameters.
In this paper, we study the impact of memory architectures, distributed memory (DM) and virtual shared memory (VSM), in the solution of parallel numerical algorithms on a multi-processor nodes cluster. the parallel im...
详细信息
the co-allocation architecture was developed to enable the parallel download of datasets/servers from selected replica servers, and the bandwidth performance is the main factor that affects the internet transfer betwe...
详细信息
ISBN:
(纸本)9783540729044
the co-allocation architecture was developed to enable the parallel download of datasets/servers from selected replica servers, and the bandwidth performance is the main factor that affects the internet transfer between the client and the server. therefore, it is important to reduce the difference of finished time among replica servers, and manage changeful network performance during the term of transferring as well. In this paper, we proposed an Anticipative Recursively-Adjusting Co-Allocation scheme, to adjust the workload of each selected replica server, which handles unwarned variant network performances of the selected replica servers. the algorithm is based on the previous finished rate of assigned transfer size, to anticipate that bandwidth status on next section for adjusting the workload, and further, to reduce file transfer time in a grid environment. Our approach is usefully in unstable gird environment, which reduces the wasted idle time for waiting the slowest server and decreases file transfer completion time.
Data cube has been playing an essential role in OLAP (online analytical processing). ne pre-computation of data cubes is critical for improving the response time of OLAP systems. However, as the size of data cube grow...
详细信息
ISBN:
(纸本)9783540729044
Data cube has been playing an essential role in OLAP (online analytical processing). ne pre-computation of data cubes is critical for improving the response time of OLAP systems. However, as the size of data cube grows, the time it takes to perform this pre-computation becomes a significant performance bottleneck. In a high dimensional OLAP, it might not be practical to build all these cuboids and their indices. In this paper, we propose a parallel hierarchical cubing algorithm, based on an extension of the previous minimal cubing approach. the algorithm has two components: decomposition of the cube space based on multiple dimension attributes, and an efficient OLAP query engine based on a prefix bitmap encoding of the indices. this method partitions the high dimensional data cube into low dimensional cube segments. Such an approach permits a significant reduction of CPU and I/O overhead for many queries by restricting the number of cube segments to be processed for boththe fact table and bitmap indices. the proposed data allocation and processing model support parallel I/O and parallelprocessing, as well as load balancing for disks and processors. Experimental results show that the proposed parallel hierarchical cubing method is significantly more efficient than other existing cubing methods.
In this paper, we introduced a reconfigurable processor optimized for implementation of Forward Error Correction (FEC) algorithms and provided the implementation results of the Viterbi and Turbo decoding algorithms. I...
详细信息
ISBN:
(纸本)9783540712671
In this paper, we introduced a reconfigurable processor optimized for implementation of Forward Error Correction (FEC) algorithms and provided the implementation results of the Viterbi and Turbo decoding algorithms. In this architecture, an array of processing elements is employed to perform the required operations in parallel. Each processing element encapsulates multiple functional units which are highly optimized for FEC algorithms. A data buffer coupled with high bandwidth interconnection network facilitates pumping the data to the array and collecting the results. A processing element controller orchestrates the operation and the data movement. Different FEC algorithms like Viterbi, Turbo, Reed-Solomon and LDPC are widely used in digital communication and could be implemented on this architecture. Unlike traditional approach to programmable FEC architectures, this architecture is instruction-level programmable which results the ultimate flexibility and programmability.
A tristate approach (TA) for image denoising processing is presented;the noise is aimed at the presence of pepper-and-salt noise. the newness of this method is that it develops a new route in the field of image restor...
详细信息
In this paper, the classification of nonoscillatory solutions for a two-dimensional neutral difference system is considered. Sufficient and/or necessary conditions of existence for those solutions will be established.
ISBN:
(纸本)0769529097
In this paper, the classification of nonoscillatory solutions for a two-dimensional neutral difference system is considered. Sufficient and/or necessary conditions of existence for those solutions will be established.
the Cell processor is a typical example of a heterogeneous multiprocessor on-chip architecture that uses several levels of parallelism to deliver high performance. Reducing the gap between peak performance and effecti...
详细信息
ISBN:
(纸本)9781595938077
the Cell processor is a typical example of a heterogeneous multiprocessor on-chip architecture that uses several levels of parallelism to deliver high performance. Reducing the gap between peak performance and effective performance is the challenge for software tool developers and the application developers. Image processing and media applications are typical "main stream" applications. We use the Harris algorithm for detection of Points of Interest in an image as a benchmark to compare the performance of several parallel schemes on a Cell processor. the impact of the DMA controlled data transfers and the synchronizations between SPEs explains the differences between the performance of the different parallelization schemes. these results will be used to design a tool for an efficient mapping of image processing applications on multi-core architectures. Copyright 2007 ACM.
暂无评论