In many application scenarios, content based pub/sub systems are required to provide stringent service guarantees such as reliable delivery, high performance in terms of throughput and low latency for event notificati...
详细信息
ISBN:
(纸本)9781450340212
In many application scenarios, content based pub/sub systems are required to provide stringent service guarantees such as reliable delivery, high performance in terms of throughput and low latency for event notification to interested subscribers. Matching algorithm play a critical role in content based pub/sub systems. The aim of our work is design and development of parallel, scalable and high performance content based publish subscribe system. We parallelize event processing using thread based and multi GPU approaches. We achieved low latency and high throughput when pub/sub is deployed on Apache Storm, a real time event processing system. Throughput gain and reduction in matching time is nearly 48% and 40% respectively in multi GPGPU approach of event processing compared to earlier work mentioned in [1].
The proceedings contain 26 papers. The topics discussed include: getting ready for approximate computing: trading parallelism for accuracy for DSS workloads;dataClay: the integration of persistent data, parallel progr...
详细信息
ISBN:
(纸本)9781467371483
The proceedings contain 26 papers. The topics discussed include: getting ready for approximate computing: trading parallelism for accuracy for DSS workloads;dataClay: the integration of persistent data, parallel programming models, and true sharing;Intel architecture and technology for future HPC system building blocks;personalized motion sensor driven gesture recognition in the FIWARE cloud platform;a simulator for analysis of opportunistic routing algorithms;multilevel task parallelism exploitation on asymmetric sets of tasks and when using third-party tools;cache affinity optimization techniques for scaling software transactional memory systems on multi-CMP architectures;high-speed security analytics powered by in-memory machine learning engine;GPU-accelerated digital halftoning by the local exhaustive search;analyzing memory access on CPU-GPGPU shared LLC architecture;and schedule dynamic multiple parallel jobs with precedence-constrained tasks on heterogeneous distributed computing systems.
Big data and the Internet of Things era continue to challenge computational systems. Several technology solutions such as NoSQL databases have been developed to deal with this challenge. In order to generate meaningfu...
详细信息
ISBN:
(纸本)9781467376846
Big data and the Internet of Things era continue to challenge computational systems. Several technology solutions such as NoSQL databases have been developed to deal with this challenge. In order to generate meaningful results from large datasets, analysts often use a graph representation which provides an intuitive way to work with the data. Graph vertices can represent users and events, and edges can represent the relationship between vertices. Graph algorithms are used to extract meaningful information from these very large graphs. At MIT, the Graphulo initiative is an effort to perform graph algorithms directly in NoSQL databases such as Apache Accumulo or SciDB, which have an inherently sparse data storage scheme. Sparse matrix operations have a history of efficient implementations and the Graph Basic Linear Algebra Subprogram (GraphBLAS) community has developed a set of key kernels that can be used to develop efficient linear algebra operations. However, in order to use the GraphBLAS kernels, it is important that common graph algorithms be recast using the linear algebra building blocks. In this article, we look at common classes of graph algorithms and recast them into linear algebra operations using the GraphBLAS building blocks.
The proceedings contain 40 papers. The topics discussed include: a parallel implementation of Chebyshev preconditioned conjugate gradient method;tuBiG - a layered infrastructure to provide support for grid functionali...
ISBN:
(纸本)0769520693
The proceedings contain 40 papers. The topics discussed include: a parallel implementation of Chebyshev preconditioned conjugate gradient method;tuBiG - a layered infrastructure to provide support for grid functionalities;efficient code generation for automatic parallelization and optimization;graphical design tool for parallel programs with execution control based on global application states;strongly consistent global states detection using relative clock errors;a distributed platform based on web services for multimedia resource discovery;performance analysis of speculative concurrency control algorithms based on wait depth limited for distributed database systems;near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid;a Java middleware platform for resource-aware distributed applications;a simple scheduling heuristic for heterogeneous computing environments;and a negotiation protocol for database resource binding.
The proceedings contain 109 papers. The topics discussed include: balanced coloring for parallel computing applications;high-performance graph analytics on manycore processors;scalable community detection with the Lou...
ISBN:
(纸本)9781479986484
The proceedings contain 109 papers. The topics discussed include: balanced coloring for parallel computing applications;high-performance graph analytics on manycore processors;scalable community detection with the Louvain algorithm;cooperative computing for autonomous data centers;divide and conquer symmetric tridiagonal eigensolver for multicore architectures;contention-based nonminimal adaptive routing in high-radix networks;identifying the culprits behind network congestion;embedding nonblocking multicast virtual networks in fat-tree data centers;cashmere: heterogeneous many-core computing;a scheduling and runtime framework for a cluster of heterogeneous machines with multiple accelerators;hierarchical DAG scheduling for hybrid distributedsystems;pushing the performance envelope of modular exponentiation across multiple generations of GPUs;and addressing fairness in SMT multicores with a progress-aware scheduler.
The proceedings contain 129 papers. The topics discussed include: spatial statistics parallel computing model of stock;an optimization method for embarrassingly parallel under MIC architecture;metadata namespace manag...
ISBN:
(纸本)9781467365932
The proceedings contain 129 papers. The topics discussed include: spatial statistics parallel computing model of stock;an optimization method for embarrassingly parallel under MIC architecture;metadata namespace management of distributed file system;research on distributed multimedia system in universities management mode;research on Petri nets parallel algorithm based on multi-core PC;a parallel algorithm of green function with free water surface;use pre-record algorithm to improve process migration efficiency;parallel algorithm study of Petri net based on multi-core clusters;temporal logic of stochastic actions for verification of probabilistic systems;quantum-behaved flower pollination algorithm;multi-objective flexible job shop schedule based on ant colony algorithm;and quantum-behaved particle swarm optimization with cooperative coevolution for large scale optimization.
Prefetching and client side caching are the two important techniques used in distributed file systems (DFSs) for improving performance. Collaborative client side caching techniques are discussed in the literature for ...
详细信息
ISBN:
(纸本)9781467391160
Prefetching and client side caching are the two important techniques used in distributed file systems (DFSs) for improving performance. Collaborative client side caching techniques are discussed in the literature for reducing the read access time in the DFS. In this paper, we have proposed to have a new type of collaborative caching algorithm which includes not only local caches but also a global cache present in the DFS. We have also proposed a novel support-based technique for prefetching the blocks of the popular files. By combining support-based prefetching with the hierarchical collaborative caching, we have proved through simulation that the read access time can be reduced in the DFS. For performance comparison purpose, we have considered the default read algorithm of Hadoop DFS and the collaborative caching algorithm proposed in the literature.
Presented herein is Uniform Time Division (UTD) of Maximum Power Tracking for distributed-Input parallel-Output (DIPO) converter power systems. The primary objective of UTD for DIPO converters is to periodically spend...
详细信息
ISBN:
(纸本)9781467375542
Presented herein is Uniform Time Division (UTD) of Maximum Power Tracking for distributed-Input parallel-Output (DIPO) converter power systems. The primary objective of UTD for DIPO converters is to periodically spend equal time in processing maximum power from each of distributed sources using only one MPT non-linear controller. As a result, the UTD-MPT controller sequentially provides equal time intervals of processing maximum power flow from the power sources. Conventionally, the peak values of the distributed source power are concurrently tracked through converters controlled by their own independent MPT controllers without UTD. However, when peak power voltages of distributed power sources are slowly changed as compared to the MPT's response time, such concurrent MPT control for all of the power sources is not necessary. By utilizing UTD of MPT non-linear control, maximum use of available power obtained from each distributed power source is achieved using a single MPT non-linear controller. The resulting system and control architectures offer maximum power transfer with a lower part count. A DIPO power converter bus architecture with a battery-dominated output voltage is described herein. The power and control architectures for DIPO converters are validated through computer simulation for fault-tolerant UTD MPT control.
The proceedings contain 30 papers. The topics discussed include: uni-address threads: scalable thread management for RDMA-based work stealing;a multiplatform study of I/O behavior on petascale supercomputers;CAST: tie...
ISBN:
(纸本)9781450335508
The proceedings contain 30 papers. The topics discussed include: uni-address threads: scalable thread management for RDMA-based work stealing;a multiplatform study of I/O behavior on petascale supercomputers;CAST: tiering storage for data analytics in the cloud;HPC system lifetime story: workload characterization and evolutionary analyses on NERSC systems;automated characterization of parallel application communication patterns;cache line aware optimizations for ccNUMA systems;XEMEM: efficient shared memory for composed applications on multi-OS/R Exascale systems;high impact computing: computing for science and the science of computing;practical resource management in power-constrained, high performance computing;optimizing grouped aggregation in geo-distributed streaming analytics;POW: system-wide dynamic reallocation of limited power in HPC;accelerating irregular computations with hardware transactional memory and active messages;fast iterative graph computation with resource aware graph parallel abstractions;bidding for highly available services with low price in spot instance market;cutting the cost of hosting online services using cloud spot markets;and towards scalable distributed workload manager with monitoring-based weakly consistent resource stealing.
For the last 40 years storage systems evolved greatly from traditional relational databases to distributed storage systems. Such dramatic changes are caused by exponential growth of Internet and mostly defined by its ...
详细信息
ISBN:
(纸本)9789897581113
For the last 40 years storage systems evolved greatly from traditional relational databases to distributed storage systems. Such dramatic changes are caused by exponential growth of Internet and mostly defined by its users and services (Int, 2014). For the past recent years both industrial and academic projects have recognized the necessity for strong consistency and ACID transactional semantics in large distributed storage systems. The main objective of this paper is to provide such strong consistency in the manner of Googles TrueTime described in (Corbett et al., 2013). We address the limitations of Google Spanner for general-purpose transactions. The result of this paper is a clock synchronization protocol (CSP) for transactions at scale.
暂无评论