Todays commercial off-the-shelf computer systems are multicore computing systems as a combination of CPU, graphic processor (GPU) and custom devices. In comparison with CPU cores, graphic cards are capable to execute ...
详细信息
Todays commercial off-the-shelf computer systems are multicore computing systems as a combination of CPU, graphic processor (GPU) and custom devices. In comparison with CPU cores, graphic cards are capable to execute hundreds up to thousands compute units in parallel. To benefit from these GPU computing resources, applications have to be parallelized and adapted to the target architecture. In this paper we show our experience in applying the NQueens puzzle solution on GPUs using Nvidia's CUDA (Compute Unified Device Architecture) technology. Using the example of memory usage and memory access, we demonstrate that optimizations of CUDA programs may have contrary results on different CUDA architectures. Evaluation results will point out, that it is not sufficient to use new programming languages or compilers to achieve best results with emerging graphic card computing.
The performance analysis of distributedsoftwaresystems is a challenging task in which the assessment of performance measures is a vital step. Due to its versatility, the concept of software performance engineering (...
详细信息
The performance analysis of distributedsoftwaresystems is a challenging task in which the assessment of performance measures is a vital step. Due to its versatility, the concept of software performance engineering (SPE) has been advocated as a promising solution towards realizing that step. This paper illustrates how by using our recently proposed Model-Driven SPE (MDSPE) approach, one can design annotated UML performance models for the performance analysis of distributedsoftwaresystems, based on the UML profile for Schedulability, Performance and Time. A case study of a business system is used to validate the stated goal.
We present Deetoo, an algorithm to perform completely general queries, for instance high-dimensional proximity queries or regular expression matching, on a P2P network. Deetoo is an efficient unstructured query system...
详细信息
ISBN:
(纸本)9781424465330
We present Deetoo, an algorithm to perform completely general queries, for instance high-dimensional proximity queries or regular expression matching, on a P2P network. Deetoo is an efficient unstructured query system on top of existing structured P2P ring topologies. Deetoo provides a reusable search tool to work alongside a DHT, thus, it provides new capabilities while reusing existing P2P models and software. Since our algorithm is for unstructured search, there is no structural relationship between the queries and the network topology and hence no need to provide a mapping of queries onto a fixed DHT structure. Deetoo is optimal in terms of the trade-off in querying and caching cost. For networks of size N, O(¿N) cost for both caching and querying is required to achieve a constant (in N) search success probability. Queries execute a time of O(log 2 N).
In this paper, we consider a methodology that utilizes qualitative expert knowledge for inference in a Bayesian network. The decision-making assumptions and the mathematical equation for Bayesian inference are derived...
详细信息
ISBN:
(纸本)9781424474226;9780769540887
In this paper, we consider a methodology that utilizes qualitative expert knowledge for inference in a Bayesian network. The decision-making assumptions and the mathematical equation for Bayesian inference are derived based on data and knowledge obtained from experts. A detailed method to transform knowledge into a set of qualitative statements and an “a priori” distribution for Bayesian probabilistic models are proposed. We also propose a simplified method for constructing the “a prior” model distribution. Each statement obtained from the experts is used to constrain the model space to the subspace which is consistent with the statement provided. Finally, we present qualitative knowledge models and then show a full formalism of how to translate a set of qualitative statements into probability inequality constraints.
This article presents the design and building of DSL-Lab, a platform to experiment on distributed computing over broadband domestic Internet. Experimental platforms such as PlanetLab and Grid'5000 are promising me...
详细信息
This article presents the design and building of DSL-Lab, a platform to experiment on distributed computing over broadband domestic Internet. Experimental platforms such as PlanetLab and Grid'5000 are promising methodological approaches to study distributedsystems. However, both platforms focus on high-end service and network deployments only available on a restricted part of the Internet, leaving aside the possibility for researchers to experiment in conditions close to what is usually available with domestic connection to the Internet. DSL-Lab is a complementary approach to PlanetLab and Grid'5000 to experiment with distributed computing in an environment closer to how Internet appears, when applications are run on end-user PCs. DSL-Lab is a set of 40 low-power and low-noise nodes, which are hosted by participants, using the participants' xDSL or cable access to the Internet. The objective is to provide a validation and experimentation platform for new protocols, services, simulators and emulators for these systems. In this paper, we report on the software design (security, resources allocation, power management) as well as on the first experiments achieved.
The effect of the harmony of the audio clip and the video clip in an audiovisual material on the estimation of its scores is experimentally clarified for the cross-media retrieval. In the experiment, four patterns of ...
详细信息
ISBN:
(纸本)9781424474226;9780769540887
The effect of the harmony of the audio clip and the video clip in an audiovisual material on the estimation of its scores is experimentally clarified for the cross-media retrieval. In the experiment, four patterns of audiovisual materials are used. These are the statically matched or mismatched, and the dynamically matched or mismatched audiovisual clips. This experiment clarifies the degree of the contribution of the harmony of audiovisual clips to their scores. It also clarifies that the degree of total harmony of the audiovisual material could be estimated by using the degree of the static harmony and that of the dynamic harmony.
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are challenging to develop and computati...
详细信息
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are challenging to develop and computationally intensive to execute. Developers need convenient abstractions to simplify the engineering of PPDM applications. The individual parties involved in the data mining process need a way to bring high-performance, parallel computers to bear on the computationally intensive parts of the PPDM tasks. This paper discusses APHID (Architecture for Private and High-performance Integrated Data mining), a practical architecture and software framework for developing and executing large scale PPDM applications. At one tier, the system supports simplified use of cluster and grid resources, and at another tier, the system abstracts communication for easy PPDM algorithm development. This paper offers a detailed analysis of the challenges in developing PPDM algorithms with existing frameworks, and motivates the design of a new infrastructure based on these challenges. (C) 2010 Elsevier B.V. All rights reserved.
A Virtual Signal Location System (VSLS) is developed to overcome some drawbacks of LANDMARC, a promising indoor-sensing system which implements RFID technology. The concept of VSLS is based on the additional virtual s...
详细信息
A Virtual Signal Location System (VSLS) is developed to overcome some drawbacks of LANDMARC, a promising indoor-sensing system which implements RFID technology. The concept of VSLS is based on the additional virtual signal tags as well as the characteristics of the normal distribution of signal strength, analysis of sampling rate and equalization to decrease signal intensity error. Some comparisons were made with LANDMARC, VSLS can effectively increase the sampling quality of signal as well as the precision. In addition, the proposed mechanism also improves the tag deployment density along with the accurate enhancement.
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs are closed under parallel composition ...
详细信息
ISBN:
(纸本)9783642170706
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs are closed under parallel composition and hiding, and show how IMCs can be compositionally aggregated prior to analysis by e.g., bisimulation minimisation or aggressive abstraction based on simulation pre-congruences. We survey some recent analysis techniques for IMCs, i.e., explaining how measures such as reachability probabilities can be obtained. Finally, we demonstrate that IMCs are a natural (and simple) semantic model for stochastic process algebras and generalised stochastic Petri nets and can be used for engineering formalisms such as AADL and dynamic fault trees.
Embedded applications can be structured in terms of mobile agents that are flexibly installed on available nodes. In wireless systems, such nodes typically have limited battery and memory resources; therefore it is im...
详细信息
ISBN:
(纸本)9781424465330
Embedded applications can be structured in terms of mobile agents that are flexibly installed on available nodes. In wireless systems, such nodes typically have limited battery and memory resources; therefore it is important to place agents judiciously. In this paper we tackle the problem of placing a newcomer agent in such a system. The problem has two main components. First, enough memory space must be found or created at some node to place the agent. Second, the placement should be energy efficient. We present heuristics for tackling these two goals in a stepwise fashion, as well as a branch and bound method for achieving both goals at the same time. Our algorithms are centralized assuming a single entry point through which agents are injected into the system, with adequate knowledge of the system state and enough resources to run the proposed algorithms. The algorithms are evaluated under different simulated scenarios, and the tradeoffs across the two metrics (space, energy) are identified.
暂无评论