the proceedings contain 14 papers. the topics discussed include: parallelization schemes for memory optimization on the cell processor: a case study of image processing algorithm;an on-chip cache design for vector pro...
the proceedings contain 14 papers. the topics discussed include: parallelization schemes for memory optimization on the cell processor: a case study of image processing algorithm;an on-chip cache design for vector processors;improving the accuracy of snoop filtering using stream registers;data prefetching and address pre-calculation through instruction pre-execution with two-step physical register deallocation;building a large instruction window through ROB compression;code-size conscious pipelining of imperfectly nested loops;improving disk bandwidth-bound applications through main memory compression;broadcast filtering-aware task assignment techniques for low-power MPSoCs;reducing leakage in power-saving capable caches for embedded systems by using a filter cache;analysis of static and dynamic energy consumption in NUCA caches: initial results;and a power-aware shared cache mechanism based on locality assessment of memory reference for CMPs.
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in the presence of partial dataset repli...
详细信息
ISBN:
(纸本)9781424415595
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in the presence of partial dataset replicas. Partial replication re-organizes and re-distributes one or more subsets of a dataset across the storage system to reduce I/O overheads and increase I/O parallelism. Our work targets a class of queries, called range queries, in which the query predicate specifies lower and upper bounds on the values of all or a subset of attributes of a dataset. Data elements whose attribute values fall into the specified bounds are retrieved from the dataset. If we think of the attributes of a dataset forming multi-dimensional space, where each attribute corresponds to one of the dimensions, a range query defines a bounding box in this multidimensional space. We evaluate our strategies in two scenarios involving range queries. the first scenario represents the case in which queries have overlapping regions of interest, such as those arising from an exploratory analysis of the dataset by multiple users. In the second scenario, queries represent adjacent rectilinear sections that capture an irregular subregion in the multi-dimensional space. this scenario corresponds to a case where the user wants to query and retrieve a spatial feature from the dataset. We propose cost models and an algorithm for optimizing such queries. Our results using queries for subsetting and analysis of medical image datasets show that effective use of partial replicas can result in reduction in query execution times.
this paper proposed a multi-FART neural network for color image segmentation. the network received three transformed color components - hue, value and saturation. then, using multi-FART network categorical ability, it...
详细信息
Image denoising that is a kind of basal pretreatment can improve visual effect of original images. Rough set is a new mathematical tool to deal with problems on vagueness and uncertainty. It is regarded as a soft comp...
详细信息
ISBN:
(纸本)9780769529097
Image denoising that is a kind of basal pretreatment can improve visual effect of original images. Rough set is a new mathematical tool to deal with problems on vagueness and uncertainty. It is regarded as a soft computation method. Being the same as fuzzy method, genetic algorithm, neural networks, it is an intellective information processing method. Rough set applies to gray image, and a new image median denoising algorithm based on rough set (RSMD) is proposed in this paper. Comparing experiments are done using classical median denoising (CAM) and the denoising algorithm presented in this paper. Experimental results show that the new algorithm denoising outperforms the classical median denoising.
this paper addresses the issue of fault tolerance in parallel computing, and proposes a new method named parallel recomputing. Such method achieves fault recovery automatically by using surviving processes to recomput...
详细信息
Touching symbols cannot be segmented accurately which is one of the main reasons for false recognition of typeset mathematical expressions. To solve this problem, a technique which is based on contour feature is prese...
详细信息
To deal withthe problem of completing the information table, a new method was studied and proposed. First, define discernible vector and its addition rule by the indiscernible relation in rough set. Second, scan disc...
详细信息
the spacing distance of amino acids is used to study the relationship between the primary structure and structural classification of large proteins. Rescaled-range (R/S) analysis was adopted to examine long-range corr...
详细信息
Cognitive Radio can achieve dynamic spectrum access by spectrum sensing. the paper proposes a new scheme to share spectrum employing OFDMA-based Cognitive Radio. To show efficiency and fairness, the paper builds an As...
详细信息
We consider the communication needs of cognitive radios, in order to ensure the unimpaired operation of licensed users and secondary users' communications isn 't intermitted. this paper proposes a STBC MC-CDMA...
详细信息
暂无评论