performance isolation is emerging as a requirement for highperformancecomputing (HPC) applications, particularly as HPC architectures turn to in situ data processing and application composition techniques to increas...
详细信息
We present Centiman, a system for highperformance, elastic transaction processing in the cloud. Centiman provides serializability on top of a key-value store with a lightweight protocol based on optimistic concurrenc...
详细信息
ISBN:
(纸本)9781450336512
We present Centiman, a system for highperformance, elastic transaction processing in the cloud. Centiman provides serializability on top of a key-value store with a lightweight protocol based on optimistic concurrency control (OCC). Centiman is designed for the cloud setting, with an architecturethat is loosely coupled and avoids synchronization wherever possible. Centiman supports sharded transaction validation;validators can be added or removed on-the-fly in an elastic manner. Processors and validators scale independently of each other and recover from failure transparently to each other. Centiman's loosely coupled design creates some challenges: it can cause spurious aborts and it makes it difficult to implement common performance optimizations for read-only transactions. To deal withthese issues, Centiman uses a watermark abstraction to asynchronously propagate information about transaction commits through the system. In an extensive evaluation we show that Centiman provides fast elastic scaling, low-overhead serializability for read-heavy workloads, and scales to millions of operations per second.
Multi-view wireless video streaming has the potential to enable a new generation of efficient and low-power pervasive surveillance systems that can capture scenes of interest from multiple perspectives, at higher reso...
详细信息
the proceedings contain 46 papers. the topics discussed include: semantic based highly accurate autonomous decentralized URL classification system for web filtering;workload estimation for improving resource managemen...
ISBN:
(纸本)9781479982615
the proceedings contain 46 papers. the topics discussed include: semantic based highly accurate autonomous decentralized URL classification system for web filtering;workload estimation for improving resource management decisions in the cloud;enhancing the performance of tree algorithm using re-split mechanism;autonomous decentralized combinatorial testing;web-based performance monitor for distributed computing;high reliability cloning technology for autonomous decentralized service-oriented architecture;physiological-signal-based key negotiation protocols for body sensor networks: a survey;trust-based task assignment in autonomous service-oriented ad hoc networks;and autonomous push-pull coordination technology to achieve reconciling resource utilization in heterogeneous communities environment.
the proceedings contain 143 papers. the topics discussed include: bridging the gap between performance and bounds of Cholesky factorization on heterogeneous platforms;efficient message logging to support process repli...
ISBN:
(纸本)0769555101
the proceedings contain 143 papers. the topics discussed include: bridging the gap between performance and bounds of Cholesky factorization on heterogeneous platforms;efficient message logging to support process replicas in a volunteer computing environment;early multi-node performance evaluation of a knights corner (KNC) Based NASA supercomputer;mini-NOVA: a lightweight ARM-based virtualization microkernel supporting dynamic partial reconfiguration;real-time multiprocessor architecture for sharing stream processing accelerators;relocation-aware floorplanning for partially-reconfigurable FPGA-based systems;experiences with compiler support for processors with exposed pipelines;performance modeling of matrix multiplication on 3d memory integrated FPGA;enhancing speedups for FPGA accelerated SPICE through frequency scaling and precision reduction;and an automated high-level design framework for partially reconfigurable FPGAs.
Exposing the rate information of wireless transmissions enables highly efficient attacks that can severely degrade the performance of a network at very low cost. In this paper, we introduce an integrated solution to c...
详细信息
We consider ad hoc wireless networks with real-time traffic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS...
详细信息
ISBN:
(纸本)9781450334891
We consider ad hoc wireless networks with real-time traffic, and study the capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity. We derive theoretical upper and lower bounds for general traffic. the bounds depend on the interference degree of the network and the max/min delay bound ratio. the performance of LDF is further evaluated using simulations and compared with two other algorithms. the simulation results show that LDF significantly outperforms the other two algorithms. Copyright is held by the author/owner(s).
In this work, we investigate routing dynamics in mobile ad hoc wireless sensor networks (WSNs), which is of great importance for network performance analysis, operation optimization, system maintenance, and network di...
详细信息
ISBN:
(纸本)9781450334891
In this work, we investigate routing dynamics in mobile ad hoc wireless sensor networks (WSNs), which is of great importance for network performance analysis, operation optimization, system maintenance, and network diagnosis. We study packet path recovery for data collection in multi-hop dynamic WSNs at the sink based on compressed sensing approach. We extend our previous outing topology recovery (RTR) approach and evaluate its performance in comparison withthe recent CSPR. Our work provides insights into the understanding of the profound impacts of different compressed sensing inspired approaches on their respective path reconstruction performance, and the resource requirement on sensor nodes. the evaluation results show that RTR can significantly outperform CSPR in various WSN setups. Copyright is held by the author/owner(s).
OpenCL has emerged as the de facto cross-platform standard in the GPU-based HPC computing domain. However, in FPGA-based HPC systems, OpenCL-to-FPGA compilers often yield suboptimal results due to the rigid architectu...
详细信息
ISBN:
(纸本)9781467394192
OpenCL has emerged as the de facto cross-platform standard in the GPU-based HPC computing domain. However, in FPGA-based HPC systems, OpenCL-to-FPGA compilers often yield suboptimal results due to the rigid architecture, limited shared-memory, and non-existent inter-work-item communication pathways implied by the OpenCL model. In this work, a methodology of inferring application-specific OpenCL "work-item" interfaces based on kernel code analysis is explored. A proof-of-concept prototype is implemented using an OpenCL source-to-source translator, which allows automated generation of the FPGA-based hardware accelerators directly from the OpenCL sources. the type and implementation of the inferred interface is tailored to match the data access patterns within the kernel. the inferred interface outperforms limitations of the OpenCL rigid architecture and communication model. the presented approach achieves a similar to 30x speedup over the generic memory-based approach for a 16 work-items application. A set of OpenCL coding patterns targeting FPGA-based HPC systems is also introduced. this technique is demonstrated on a popular bioinformatics algorithm, yet is applicable to any such algorithm with non-standard inter-cell communications.
Mobile opportunistic network (MON) is a new paradigm which exploits node contacts to forward data, enabling numerous and impressive applications. the data copy spraying scheme is a challenging problem in MON, due to t...
详细信息
ISBN:
(纸本)9781450334891
Mobile opportunistic network (MON) is a new paradigm which exploits node contacts to forward data, enabling numerous and impressive applications. the data copy spraying scheme is a challenging problem in MON, due to the mobility of nodes and lack of global knowledge, it hence captures great interests from research communities. Traditional algorithms allocate data copies with node’s statistical information and neglect the temporal contact feature, resulting in a poor delivery performance. We propose AS, an adaptive data copy spraying scheme in MON. AS adjusts the number of copies dynamically based on the temporal contact feature among nodes. theoretical analysis verifies that AS achieves a lower mean delivery delay than SprayWait, one of the state-of-the-art works. Simulation results show that AS improves the packet delivery ratio simultaneously. Copyright is held by the author/owner(s).
暂无评论