the proceedings contain 76 papers. the topics discussed include: selfish distributed optimization;tulipse: a visualization framework for user-guided parallelization;pattern-independent detection of manual collectives ...
ISBN:
(纸本)9783642328190
the proceedings contain 76 papers. the topics discussed include: selfish distributed optimization;tulipse: a visualization framework for user-guided parallelization;pattern-independent detection of manual collectives in MPI programs;a type-based approach to separating protocol from application logic: a case study in hybrid computer programming;energy consumption modeling for hybrid computing;HPC file systems in wide area networks: understanding the performance of luster over wan;understanding I/O performance using I/O skeletal applications;CRAW/P: a workload partition method for the efficient parallel simulation of manycores;job scheduling using successive linear programming approximations of a sparse model;speed scaling on parallel processors with migration;dynamic distributed scheduling algorithm for state space search;and using load information in work-stealing on distributedsystems with non-uniform communication latencies.
the proceedings contain 16 papers. the special focus in this conference is on Coordination Models and Languages. the topics include: Multilevel transitive and intransitive non-interference, causally;a game interpretat...
ISBN:
(纸本)9783319395180
the proceedings contain 16 papers. the special focus in this conference is on Coordination Models and Languages. the topics include: Multilevel transitive and intransitive non-interference, causally;a game interpretation of retractable contracts;tuple spaces implementations and their efficiency;on-the-fly mean-field model-checking for attribute-based coordination;scheduling games for concurrent systems;an asynchronous parallel abstraction for speculative pipeline computations;modelling ambulance deployment with CARMA;on synchronous and asynchronous compatibility of communicating components;a formal analysis of the global sequence protocol;improving gossip dynamics through overlapping replicates;from modelling to systematic deployment of distributed active objects;an interference-free programming model for network objects and on sessions and infinite data.
Since data dependencies greatly decrease instruction level parallelism, minimizing dependencies becomes a crucial part of the process of parallelizing sequential code. Eliminating all unnecessary hazards leads to the ...
详细信息
Since data dependencies greatly decrease instruction level parallelism, minimizing dependencies becomes a crucial part of the process of parallelizing sequential code. Eliminating all unnecessary hazards leads to the more efficient use of resources, fewer processor stalls and easily maintainable code. Previously we proposed a novel approach for eliminating redundant data dependencies from code. In this paper, we review this method and show how this elimination technique may be combined with unfolding so as to parallelize code even further.
Network swapping systems allow individual cluster nodes with over-committed memory to use the idle memory of remote nodes as their backing store, and to swap their pages over the network. As the number of nodes in a c...
详细信息
Network swapping systems allow individual cluster nodes with over-committed memory to use the idle memory of remote nodes as their backing store, and to swap their pages over the network. As the number of nodes in a cluster increases, it becomes more likely that a node will fail or become unreachable, making it important that such a system provide reliability support. Without reliability, a single node crash can affect programs running on other cluster nodes by losing remotely swapped page data that was stored on the crashed node. Our network swapping system, Nswap, has design features that complicate reliability: swapped pages can migrate from one node to another in response to changes in a node's local memory needs. As a result, reliability schemes that rely on fixed placement of page and reliability data are not applicable to our system. Our reliability solutions solve the unique challenge of providing reliability to network swapping systemsthat both support dynamic changes to the size of remote RAM swap space and support migration of remotely swapped page data. Results show that even though our Mirroring reliability scheme adds time and space overhead to Nswap, it still outperforms swapping to disk by a factor of up to 8.2. Our dynamic Parity scheme will provide reliability with minimal time and space overhead.
Approaching a comprehensive performance benchmark for on-line transaction processing (OLTP) applications in a cloud environment is a challenging task. Fundamental features of clouds, such as the pay-as-you-go pricing ...
详细信息
ISBN:
(纸本)9781479954704
Approaching a comprehensive performance benchmark for on-line transaction processing (OLTP) applications in a cloud environment is a challenging task. Fundamental features of clouds, such as the pay-as-you-go pricing model and unknown underlying configuration of the system, are contrary to the basic assumptions of available benchmarks such as TPC-W or RUBiS. In this paper, we introduce a systematic performance benchmark approach for OLTP applications on public clouds that use virtual machines (VMs). We propose WPress benchmark, which is based on the widespread blogging software, WordPress, as a representative OLTP application and implement an open source workload generator. Furthermore, we utilize a CPU micro-benchmark to investigate CPU performance of cloud-based VMs in greater detail. Average response time and total VM cost are the performance metrics measured by WPress. We evaluate small and large instance types of three real-life cloud providers, Amazon EC2, Microsoft Azure and Rackspace cloud. Results imply that Rackspace cloud has better average response times and total VM cost on small instances. However, Microsoft Azure is preferable for large instance type.
In this article, a new optimization algorithm that is inspired by the biology of hydrozoa (HA) is proposed. Our aim was to develop an algorithm that is based on the regeneration and transplantation processes of hydroz...
详细信息
ISBN:
(纸本)9781509055043
In this article, a new optimization algorithm that is inspired by the biology of hydrozoa (HA) is proposed. Our aim was to develop an algorithm that is based on the regeneration and transplantation processes of hydrozoa for finding the best solutions for continuous optimization problems. Basically, HA follows the same general processes of evolutionary algorithm;however, its distinctive processes mimic the life cycle of 3 basic forms of hydrozoa: motile planula, polyps, and medusa. In particular, the growth of strong buds from the polyp stage depends on levels of morphogens: activators and inhibitors. these 3 forms develop or evolve into the best solution. HA was performance tested with 20 standard benchmark functions and compared with genetic algorithm and Particle Swarm Optimization (PSO). the test results have confirmed that the proposed algorithm is computationally more efficient than both GA and PSO. It works very well on most benchmark functions.
Many comic books are now published as digital books, which easily provide color contents compared to the physical books. the motivation of automatic colorization of comic books now arises. Previous studies colorize sk...
详细信息
ISBN:
(纸本)9781509055043
Many comic books are now published as digital books, which easily provide color contents compared to the physical books. the motivation of automatic colorization of comic books now arises. Previous studies colorize sketches without other clues or with spatial color annotations. they are expected to reduce workloads of comic artists but still require spatial color annotations for desirable colorizations. this study introduces a color style information and combines it with conditional adversarially learned inference. the experimental results demonstrate that the objects are painted with colors depending on the color style information and that the color style information extracted from a color image supports to painting an object with a desirable color.
Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing ...
详细信息
ISBN:
(纸本)9780889867307
Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing computation technique will suffer a huge computations time and spaces when calculating a very large size of public-key and private-key. Recently, a method for fast LUC Cryptosystems computation on single processor has been proposed. In this paper, we extend the method in parallel on distributed memory multiprocessor machine using message-passing interface. We are generating a special sequence from a given value of public-key and private-key. this special sequence will be used to direct the computation of LUC. We examine the parallelism efficiency of the algorithm by analyze the simulation time and speedup.
Withthe number increase of biomedical literatures, biomedical relation extraction discovery from the literature represents a new challenge for researchers in recent years. then, a system that automatically extracts t...
详细信息
ISBN:
(纸本)9781509055043
Withthe number increase of biomedical literatures, biomedical relation extraction discovery from the literature represents a new challenge for researchers in recent years. then, a system that automatically extracts the related genes to the targeted disease is required. In this paper, we explore text mining and pattern clustering for relation extraction of breast cancer and related genes. It can be considered an unsupervised method and labeled data is not necessary. We firstly extract the candidate genes related to breast cancer by checking the window distance between the appearance of genes and breast cancer in a sentence. then, two different clustering approaches (simple clustering and K-means clustering) are applied for finding the candidate association words that indicate the relationship between breast cancer and genes. the comparison experiment demonstrates that simple clustering is superior to K-means clustering in this task.
Passenger hotspots searching is essential to increase profits for taxis drivers in urban area. In this paper, we propose a two-step approach for pick-up hotspots searching. In the first step, a traveling similarity mo...
详细信息
ISBN:
(纸本)9781509055043
Passenger hotspots searching is essential to increase profits for taxis drivers in urban area. In this paper, we propose a two-step approach for pick-up hotspots searching. In the first step, a traveling similarity model is built to quantify the similarity of traveling behaviors. In the second step, we utilize affinity propagation and simulated annealing to identify the daily passenger hotspots in a selected period. Numerical results based on GPS data of Manhattan taxis suggest that the proposed approach outperforms the traditional spatio-temporal clustering regardless of buffer radius.
暂无评论