Wild populations of organism are often difficult to study in their natural settings. Often, it is possible to infer mating information about these species by genotyping the offspring and using the genetic information ...
详细信息
Replication is a common method for increasing the availability of data in a distributed environment. Our interest is in the application of replication techniques in the domain of parallelprocessing. This paper explor...
详细信息
ISBN:
(纸本)0818626720
Replication is a common method for increasing the availability of data in a distributed environment. Our interest is in the application of replication techniques in the domain of parallelprocessing. This paper explores the issues concerning degree of replication and granularity in the context of a distributed and highly available Linda tuple space. In particular, we study the performance effects of varying the number of replicas and the granularities of replication and concurrency control. Traditionally, when using replication in databases, the granularity of replication and that of concurrency control have been the same (at the file level, for example). This is not an inherent requirement however. In this paper we show by detailed simulation of a replicated Linda tuple space that it is useful to separate the two granularities and that it is an important design issue especially in parallelprocessing systems.
parallelapplications of the same domain can present similar patterns of behavior and characteristics. Characterizing common application behaviors can help for understanding performance aspects in the real-world scena...
详细信息
ISBN:
(纸本)9781728116440
parallelapplications of the same domain can present similar patterns of behavior and characteristics. Characterizing common application behaviors can help for understanding performance aspects in the real-world scenario. One way to better understand and evaluate applications' characteristics is by using customizable/parametric benchmarks that enable users to represent important characteristics at run-time. We observed that parameterization techniques should be better exploited in the available benchmarks, especially on stream processing domain. For instance, although widely used, the stream processing benchmarks available in PARSEC do not support the simulation and evaluation of relevant and modern characteristics. Therefore, our goal is to identify the stream parallelism characteristics present in PARSEC. We also implemented a ready to use parameterization support and evaluated the application behaviors considering relevant performance metrics for stream parallelism (service time, throughput, latency). We choose Dedup to be our case study. The experimental results have shown performance improvements in our parameterization support for Dedup. Moreover, this support increased the customization space for benchmark users, which is simple to use. In the future, our solution can be potentially explored on different parallel architectures and parallel programming frameworks.
With concepts such as the Internet of Things becoming more commonplace, greater emphasis must be placed on data privacy in large-scale public networks for these to be used securely without the threat of data theft. Mo...
详细信息
Many analyses and transformations in a parallelizing compiler can benefit from the ability to compare arbitrary symbolic expressions. In this paper, we describe how one can compare expressions by using symbolic ranges...
详细信息
Many analyses and transformations in a parallelizing compiler can benefit from the ability to compare arbitrary symbolic expressions. In this paper, we describe how one can compare expressions by using symbolic ranges of variables. A range is a lower and upper bound on a variable. We will also describe how these ranges can be efficiently computed from the program text. Symbolic range propagation has been implemented in Polaris, a parallelizing compiler being developed at the University of Illinois, and is used for symbolic dependence testing, detection of zero-trip loops, determining array sections possibly referenced by an access, and loop iteration-count estimation.
For large-scale multitask wireless sensor networks (LSM-WSNs), the traditional data collection mode could suffer low energy-efficiency on data transmission, since the large-scale multitask scenarios could result in mu...
详细信息
In this paper, we propose a multi-paradigm and multi-grain parallel execution model based on SMP-Cluster, which integrates coarse grain, mid grain and fine grain parallelism. Multiple paradigms supported by our model ...
详细信息
ISBN:
(纸本)0769526438
In this paper, we propose a multi-paradigm and multi-grain parallel execution model based on SMP-Cluster, which integrates coarse grain, mid grain and fine grain parallelism. Multiple paradigms supported by our model include task parallel, data parallel, sequential execution, data pipeline and task-farming paradigm. It can be achieved by extending the OpenMP specification, and the extensions include directives for computing resource partition, data distribution and alignment, sequential execution and data pipeline, and functions for Master/Slave model in Macro-Task group. We also compare the performance of different implementations of three benchmark applications, using the same numerical algorithm but employing different programming approaches.
Given a network of N nodes with the i-th sensor's observation x(i) is an element of R-M, the matrix containing all Euclidean distances among measurements parallel to x(i) - x(j)parallel to for all i, j is an eleme...
详细信息
ISBN:
(纸本)9781424423538
Given a network of N nodes with the i-th sensor's observation x(i) is an element of R-M, the matrix containing all Euclidean distances among measurements parallel to x(i) - x(j)parallel to for all i, j is an element of {1, ... ,N} is a useful description of the data. While reconstructing a distance matrix has wide range of applications, we are particularly interested in the manifold reconstruction and its dimensionality reduction for data fusion and query) To make this map available to the all of the nodes in the network, we propose a fully decentralized consensus gossiping algorithm which is based oil local neighbor communications, and does not require the existence of a central entity. The main advantage of our solution is that it is insensitive to changes in the network topology and it is fully decentralized. We, describe the proposed algorithm in detail, study its complexity in terms of the number of inter-node radio transmissions and showcase its performance numerically.
distributedapplications are realized by cooperation of multiple objects. Objects in the systems are replicated to make the systems fault-tolerant. Read and write request messages are issued to the replicas in a quoru...
详细信息
ISBN:
(纸本)0769505686
distributedapplications are realized by cooperation of multiple objects. Objects in the systems are replicated to make the systems fault-tolerant. Read and write request messages are issued to the replicas in a quorum-based scheme. In this paper, a quorum-based ordered relation among request messages is defined to make replicas consistent. We discuss a group protocol which supports a group of replicas with the quorum-based ordered delivery of request messages.
An architecture for a reconfigurable superscalar processor is described in which some of its execution units are implemented in reconfigurable hardware. The overall configuration of the processor is defined according ...
详细信息
ISBN:
(纸本)0769523129
An architecture for a reconfigurable superscalar processor is described in which some of its execution units are implemented in reconfigurable hardware. The overall configuration of the processor is defined according to how its reconfigurable execution units are configured. An efficient micro-architectural solution to configuration management is presented that effectively steers the current processor configuration toward a configuration that is well matched with the execution unit requirements of instructions being scheduled for execution. The approach first selects the best matched among four steering configurations based on the number and type of execution units required by the instructions. One of the steering configurations is dynamically defined as the current configuration;the other three are statically predefined. Once a steering configuration is selected, portions of it begin loading on corresponding reconfigurable execution units that are not busy. The active configuration of the processor is generally the overlap of two or more steering configurations.
暂无评论