检索结果-内蒙古大学图书馆

6th International Conference on Cloud Computing and Services Science (CLOSER)

作者： le Roux, Pierre Bernard Kroon, Steve Bester, Willem Univ Stellenbosch Comp Sci Stellenbosch South Africa CSIR SU Ctr Artificial Intelligence Res Stellenbosch South Africa

ISBN: (纸本)9789897581823

In an attempt to tackle shortcomings of current approaches to collaborating on the development of structured data sets, we present a prototype platform that allows users to share and collaborate on the development of data structures via a web application, or by using language bindings or an API. Using techniques from the theory of persistent linked data structures, the resulting platform delivers automatically version-controlled map and graph abstract data types as a web service. The core of the system is provided by a Hash Array Mapped Trie (HAMT) which is made confluently persistent by path-copying. The system aims to make efficient use of storage, and to have consistent access and update times regardless of the version being accessed or modified.

关键词： DaaS SaaS Cloud Computing persistent data structure Version Control System Hash-Array Mapped Trie

来源：评论

学校读者我要写书评

暂无评论

Towards Model Checking Library for persistent data structures 7

Towards Model Checking Library for Persistent Data Structure...

引用

7th IEEE Non-Volatile Memory Systems and Applications Symposium (NVMSA)

作者： Iiboshi, Hiroyuki Ugawa, Tomoharu Kochi Univ Technol Kochi Japan

ISBN: (纸本)9781538674031

persistent concurrent data structures, which allow concurrent access and store critical data into byte-addressable non-volatile memory (NVM) to keep them beyond system crashes, are attractive. However, they are complicated and hard to be confident in the correctness of them because 1) cache and registers are expected to remain volatile, and 2) cache flush instructions are reordered with load and store instructions in accordance with the memory model of the system. This paper provides a design of a model checking library, named MMLib-NVM, which is useful to verify persistent concurrent data structures that run on hardware with a weak memory model and non-volatile memory. The library is for the SPIN model checker. MMLib-NVM allows the users to develop models of their data structures without considering the memory model and behaviour of NVM, besides explicit memory barriers and cache flush instructions. We implemented a prototype of MMLib-NVM and investigated a property derived from durable linearisability of a persistent lock-free queue, the durable queue, of Friedman et al. against the sequential consistency and total store ordering memory models by model checking using MMLib-NVM.

关键词： persistent data structure model checking nonvolatile memory

来源：评论

学校读者我要写书评

暂无评论

Opportunities for Nonvolatile Memory Systems in Extreme-Scale High-Performance Computing

引用

COMPUTING IN SCIENCE & ENGINEERING 2015年第2期17卷 73-82页

作者： Vetter, Jeffrey S. Mittal, Sparsh Oak Ridge Natl Lab Oak Ridge TN 37831 USA

As the benefits of device scaling for DRAM memory diminish, it will become increasingly difficult to keep memory capacities balanced with increasing computational rates offered by next-generation processors. Emerging memory technologies such as nonvolatile memory devices could provide an important alternative for extreme-scale high-performance computing systems.

关键词： DRAM chips parallel memories parallel processing power aware computing DRAM memory HPC architecture NVM device application resilience extreme scale high-performance computing next generation processor nonvolatile memory systems output postprocessing persistent data structure software stack system wide power consumption Flash memories High performance computing Market research Memory management Nonvolatile memory Phase change random access memory Scientific computing Supercomputers DRAM PCM ReRAM STT-RAM flash high-performance computing nonvolatile memory scientific computing supercomputing

来源：评论

学校读者我要写书评

暂无评论

Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations

引用

DISCRETE APPLIED MATHEMATICS 2016年第0期212卷 61-80页

作者： Denzumi, Shuhei Yoshinaka, Ryo Arimura, Hiroki Minato, Shin-ichi Hokkaido Univ Grad Sch Informat Sci & Technol N14W9 Sapporo Hokkaido 0600814 Japan Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan JST ERATO MINATO Discrete Struct Manipulat Syst Proje Tokyo Japan

The manipulation of large sequence data is one of the most important problems in string processing. In this paper, we discuss a new data structure for storing and manipulating sets of strings, called Sequence Binary Decision Diagrams (sequence BDDs), which has recently been introduced by Loekito et al. (2010) as a descendant of both acyclic DFAs (ADFAs) and binary decision diagrams (BDDs). Sequence BDDs can compactly represent sets of sequences similarly to minimal ADFAs, and allow efficient set operations inherited from BDDs. We study fundamental properties of sequence BDDs, such as the characterization of minimal sequence BDDs by reduced sequence BDDs, non-trivial relationships between sizes of minimal sequence BDDs and minimal ADFAs, the complexities of minimization, Boolean set operations, and sequence BDD construction. We also show experimental results for real and artificial data sets. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Sequence binary decision diagram persistent data structure Deterministic finite automaton Minimization Boolean set operation

来源：评论

学校读者我要写书评

暂无评论

Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using persistent Time-Octree (PTOT)

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2009年第6期15卷 1367-1374页

作者： Wang, Cong Chiang, Yi-Jen NYU Polytech Inst CSE Dept Brooklyn NY USA

We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel persistent Time-Octree (PTOT) indexing structure. Previously, the persistent Octree (POT) was proposed to perform isosurface extraction and view-dependent filtering, which combines the advantages of the interval tree (for optimal searches of active cells) and of the Branch-On-Need Octree (BONO, for view-dependent filtering), but it only works for steady-state (i.e., single time step) data. For time-varying fields, a 4D version of POT, 4D-POT, was proposed for 4D isocontour slicing, where slicing on the time domain gives all active cells in the queried time step and isovalue. However, such slicing is not output sensitive and thus the searching is sub-optimal. Moreover, it was not known how to support view-dependent filtering in addition to time-domain slicing. In this paper, we develop a novel persistent Time-Octree (PTOT) indexing structure, which has the advantages of POT and performs 4D isocontour slicing on the time domain with an output-sensitive and optimal searching. In addition, when we query the same isovalue q over m consecutive time steps, there is no additional searching overhead (except for reporting the additional active cells) compared to querying just the first time step. Such searching performance for finding active cells is asymptotically optimal, with asymptotically optimal space and preprocessing time as well. Moreover, our PTOT supports view-dependent filtering in addition to time-domain slicing. We propose a simple and effective out-of-core scheme, where we integrate our PTOT with implicit occluders, batched occlusion queries and batched CUDA computing tasks, so that we can greatly reduce the I/O cost as well as increase the amount of data being concurrently computed in GPU. This results in an efficient algorithm for isosurface extraction with view-dependent filtering utilizing a state-of-the-art programmable GPU for

关键词： Isosurface extraction time-varying fields persistent data structure view-dependent filtering out-of-core methods

来源：评论

学校读者我要写书评

暂无评论

Towards a Software Product Line of Trie-Based Collections 2016

Towards a Software Product Line of Trie-Based Collections

引用

15th ACM International Conference on Generative Programming - Concepts and Experiences (GPCE)

作者： Steindorfer, Michael J. Vinju, Jurgen J. Ctr Wiskunde & Informat Amsterdam Netherlands

ISBN: (纸本)9781450344463

Collection data structures in standard libraries of programming languages are designed to excel for the average case by carefully balancing memory footprint and runtime performance. These implicit design decisions and hard-coded trade-offs do constrain users from using an optimal variant for a given problem. Although a wide range of specialized collections is available for the Java Virtual Machine (JVM), they introduce yet another dependency and complicate user adoption by requiring specific Application Program Interfaces (APIs) incompatible with the standard library. A product line for collection data structures would relieve library designers from optimizing for the general case. Furthermore, a product line allows evolving the potentially large code base of a collection family efficiently. The challenge is to find a small core framework for collection data structures which covers all variations without exhaustively listing them, while supporting good performance at the same time. We claim that the concept of Array Mapped Tries (AMTs) embodies a high degree of commonality in the sub-domain of immutable collection data structures. AMTs are flexible enough to cover most of the variability, while minimizing code bloat in the generator and the generated code. We implemented a data structure Code Generator (DSCG) that emits immutable collections based on an AMT skeleton foundation. The generated data structures outperform competitive hand-optimized implementations, and the generator still allows for customization towards specific workloads.

关键词： Code generation persistent data structure Hash trie Performance Immutability Software product line

来源：评论

学校读者我要写书评

暂无评论

persistent Bloom Filter: Membership Testing for the Entire History 18

Persistent Bloom Filter: Membership Testing for the Entire H...

引用

44th ACM SIGMOD International Conference on Management of data

作者： Peng, Yanqing Guo, Jinwei Li, Feifei Qian, Weining Zhou, Aoying Univ Utah Salt Lake City UT 84112 USA East China Normal Univ Shanghai Peoples R China

ISBN: (纸本)9781450317436

Membership testing is the problem of testing whether an element is in a set of elements. Performing the test exactly is expensive space-wise, requiring the storage of all elements in a set. In many applications, an approximate testing that can be done quickly using small space is often desired. Bloom filter (BF) was designed and has witnessed great success across numerous application domains. But there is no compact structure that supports set membership testing for temporal queries, e.g., has person A visited a web server between 9:30am and 9:40am? And has the same person visited the web server again between 9:45am and 9:50am? It is possible to support such "temporal membership testing" using a BF, but we will show that this is fairly expensive. To that end, this paper designs persistent bloom filter (PBF), a novel data structure for temporal membership testing with compact space.

关键词： Bloom filter persistent bloom filter persistent data structure

来源：评论

学校读者我要写书评

暂无评论

Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections 2015

Optimizing Hash-Array Mapped Tries for Fast and Lean Immutab...

引用

ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA)

作者： Steindorfer, Michael J. Vinju, Jurgen J. Ctr Wiskunde & Informat Amsterdam Netherlands TU Eindhoven Eindhoven Netherlands INRIA Lille Lille France

ISBN: (纸本)9781450336895

The data structures under-pinning collection API (e.g. lists, sets, maps) in the standard libraries of programming languages are used intensively in many applications. The standard libraries of recent Java Virtual Machine languages, such as Clojure or Scala, contain scalable and well-performing immutable collection data structures that are implemented as Hash-Array Mapped Tries (HAMTs). HAMTs already feature efficient lookup, insert, and delete operations, however due to their tree-based nature their memory footprints and the runtime performance of iteration and equality checking lag behind array-based counterparts. This particularly prohibits their application in programs which process larger data sets. In this paper, we propose changes to the HAMT design that increase the overall performance of immutable sets and maps. The resulting general purpose design increases cache locality and features a canonical representation. It outperforms Scala's and Clojure's data structure implementations in terms of memory footprint and runtime efficiency of iteration (1.3-6.7 x) and equality checking (3-25.4 x).

关键词： Hash trie persistent data structure immutability performance cache locality Java Virtual Machine

来源：评论

学校读者我要写书评

暂无评论

Code Specialization for Memory Efficient Hash Tries (Short Paper) 2014

Code Specialization for Memory Efficient Hash Tries (Short P...

引用

13th Conference on Generative Programming - Concepts and Experiences (GPCE)

作者： Steindorfer, Michael J. Vinju, Jurgen J. Ctr Wiskunde & Informat Amsterdam Netherlands

ISBN: (纸本)9781450331616

The hash trie data structure is a common part in standard collection libraries of JVM programming languages such as Clojure and Scala. It enables fast immutable implementations of maps, sets, and vectors, but it requires considerably more memory than an equivalent array-based data structure. This hinders the scalability of functional programs and the further adoption of this otherwise attractive style of programming. In this paper we present a product family of hash tries. We generate Java source code to specialize them using knowledge of JVM object memory layout. The number of possible specializations is exponential. The optimization challenge is thus to find a minimal set of variants which lead to a maximal loss in memory footprint on any given data. Using a set of experiments we measured the distribution of internal tree node sizes in hash tries. We used the results as a guidance to decide which variants of the family to generate and which variants should be left to the generic implementation. A preliminary validating experiment on the implementation of sets and maps shows that this technique leads to a median decrease of 55% in memory footprint for maps (and 78% for sets), while still maintaining comparable performance. Our combination of data analysis and code specialization proved to be effective.

关键词： Code generation Specialization Hash trie persistent data structure Immutability Performance Memory optimization Experimentation Measurement Performance

来源：评论

学校读者我要写书评

暂无评论

Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using persistent Time-Octree (PTOT)

Isosurface Extraction and View-Dependent Filtering from Time...

引用

IEEE Information Visualization Conference/IEEE Visualization Conference

作者： Wang, Cong Chiang, Yi-Jen NYU Polytech Inst CSE Dept Brooklyn NY USA

关键词： Isosurface extraction time-varying fields persistent data structure view-dependent filtering out-of-core methods

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：