the Probabilistic Concurrency Testing (PCT) algorithm that provides theoretical guarantees on the probability of detecting concurrency bugs does not apply to weak memory programs. the PCT algorithm builds on the inter...
详细信息
ISBN:
(纸本)9781450399166
the Probabilistic Concurrency Testing (PCT) algorithm that provides theoretical guarantees on the probability of detecting concurrency bugs does not apply to weak memory programs. the PCT algorithm builds on the interleaving semantics of sequential consistency, which does not hold for weak memory concurrency. It is because weak memory concurrency allows additional behaviors that cannot be produced by any interleaving execution. In this paper, we generalize PCT to address weak memory concurrency and present Probabilistic Concurrency Testing for Weak Memory (PCTWM). We empirically evaluate PCTWM on a set of well-known weak memory program benchmarks in comparison to the state-of-the-art weak memory testing tool C11Tester. Our results show that PCTWM can detect concurrency bugs more frequently than C11Tester.
the area of technology-enhanced language learning (TELL) has traditionally focused on languages with many speakers and multiple resources available. However, there are numerous affordances of TELL which can support sm...
详细信息
this paper proposes Khuzdul, a distributed execution engine with a well-defined abstraction that can be integrated with existing singlemachine graph pattern mining (GPM) systems to provide efficiency and scalability a...
详细信息
ISBN:
(纸本)9781450399166
this paper proposes Khuzdul, a distributed execution engine with a well-defined abstraction that can be integrated with existing singlemachine graph pattern mining (GPM) systems to provide efficiency and scalability at the same time. the key novelty is the extendable embedding abstraction which can express pattern enumeration algorithms, allow fine-grained task scheduling, and enable low-cost GPM-specific data reuse to reduce communication cost. the effective BFS-DFS hybrid exploration generates sufficient concurrent tasks for communication-computation overlapping with bounded memory consumption. Two scalable distributed GPM systems are implemented by porting Automine and GraphPi on Khuzdul. Our evaluation shows that Khuzdul based systems significantly outperform state-of-the-art distributed GPM systems with partitioned graphs by up to 75.5x (on average 19.0x), achieve similar or even better performance compared withthe fastest distributed GPM systems with replicated graph, and scale to massive graphs with more than one hundred billion edges with a commodity cluster.
the proceedings contain 9 papers. the topics discussed include: AQUATOPE: QoS-and-uncertainty-aware resource management for multi-stage serverless workflows;CAFQA: a classical simulation bootstrap for variational quan...
ISBN:
(纸本)9781450399159
the proceedings contain 9 papers. the topics discussed include: AQUATOPE: QoS-and-uncertainty-aware resource management for multi-stage serverless workflows;CAFQA: a classical simulation bootstrap for variational quantum algorithms;cooperative concurrency control for write-intensive key-value workloads;DecoMine: a compilation-based graph pattern mining system withpattern decomposition;Erms: efficient resource management for shared microservices with SLA guarantees;Glign: taming misaligned graph traversals in concurrent graph processing;overlap communication with dependent computation via decomposition in large deep learning models;risotto: a dynamic binary translator for weak memory model architectures;and TelaMalloc: efficient on-chip memory allocation for production machine learning accelerators.
Graph pattern mining (GPM) is an important application that identifies structures from graphs. Despite the recent progress, the performance gap between the state-of-the-art GPM systems and an efficient algorithmDpatte...
详细信息
ISBN:
(纸本)9781450399159
Graph pattern mining (GPM) is an important application that identifies structures from graphs. Despite the recent progress, the performance gap between the state-of-the-art GPM systems and an efficient algorithmDpattern decompositionDis still at least an order of magnitude. this paper clears the fundamental obstacles of adopting pattern decomposition to a GPM system. First, the performance of pattern decomposition algorithms depends on how to decompose the whole pattern into subpatterns. the original method performs complexity analysis of algorithms for different choices, and selects the one withthe lowest complexity upper bound. Clearly, this approach is not feasible for average or even expert users. To solve this problem, we develop a GPM compiler with conventional and GPM-specific optimizations to generate algorithms for different decomposition choices, which are evaluated based on an accurate cost model. the executable of the GPM task is obtained from the algorithm withthe best performance. Second, we propose a novel partial-embedding API that is sufficient to construct advanced GPM applications while preserving pattern decomposition algorithm advantages. Compared to state-of-the-art systems, our new GPM system, DecoMine, developed based on the ideas, reduces the execution time of GPM on large graphs and patterns from days to a few hours with low programming effort.
the proceedings contain 15 papers. the topics discussed include: all watched over by machines of loving grace;classical natural deduction from truth tables;on dynamic lifting and effect typing in circuit description l...
ISBN:
(纸本)9783959772853
the proceedings contain 15 papers. the topics discussed include: all watched over by machines of loving grace;classical natural deduction from truth tables;on dynamic lifting and effect typing in circuit description languages;on the fair termination of client-server sessions;mitten: a flexible multimodal proof assistant;an irrelevancy-eliminating translation of pure type systems;a metatheoretic analysis of subtype universes;pragmatic isomorphism proofs between Coq representations: application to lambda-term families;type theory with explicit universe polymorphism;a univalent formalization of constructive affine schemes;and univalent monoidal categories.
Graph pattern matching is one of the most fundamental problems in graph database and is associated with a wide spectrum of applications. Due to its computational intensiveness, researchers have primarily devoted their...
详细信息
ISBN:
(纸本)9781450369763
Graph pattern matching is one of the most fundamental problems in graph database and is associated with a wide spectrum of applications. Due to its computational intensiveness, researchers have primarily devoted their efforts to improving the performance of the algorithm while constraining the graphs to have singular labels on vertices (edges) or no label. Whereas in practice graphs are typically associated with rich properties, thus the main focus in the industry is instead on powerful query languagesthat can express a sufficient number of pattern matching scenarios. We demo PatMat in this work to glue together the academic efforts on performance and the industrial efforts on expressiveness. To do so, we leverage the state-of-the-art join-based algorithms in the distributed contexts and Cypher query language - the most widely-adopted declarative language for graph pattern matching. the experiments demonstrate how we are capable of turning complex Cypher semantics into a distributed solution with high performance.
the proceedings contain 27 papers. the topics discussed include: state-sensitive points-to analysis for the dynamic behavior of JavaScript objects;self-inferencing reflection resolution for java;constructing call grap...
ISBN:
(纸本)9783662442012
the proceedings contain 27 papers. the topics discussed include: state-sensitive points-to analysis for the dynamic behavior of JavaScript objects;self-inferencing reflection resolution for java;constructing call graphs of scala programs;finding reference-counting errors in python/C programs with affine analysis;safely composable type-specific languages;graceful dialects;structuring documentation to support state search: a laboratory experiment about protocol programming;reusable concurrent data types;infrastructure-free logging and replay of concurrent execution on multiple cores;sound and complete subtyping between co-inductive types for object-oriented languages;spores: a type-based foundation for closures in the age of concurrency and distribution;rely-guarantee protocols;and stream processing with a spreadsheet.
the proceedings contain 23 papers. the topics discussed include: manticore: hardware-accelerated RTL simulation with static bulk-synchronous parallelism;exploiting the regular structure of modern quantum architectures...
ISBN:
(纸本)9798400703942
the proceedings contain 23 papers. the topics discussed include: manticore: hardware-accelerated RTL simulation with static bulk-synchronous parallelism;exploiting the regular structure of modern quantum architectures for compiling and optimizing programs with permutable operators;MiniMalloc: a lightweight memory allocator for hardware-accelerated machine learning;DREAM: a dynamic scheduler for dynamic real-time multi-model ml workloads;supporting descendants in SIMD-accelerated JSONPath;DataFlower: exploiting the data-flow paradigm for serverless workflow orchestration;predict;don’t react for enabling efficient fine-grain DVFS in GPUs;LightRidge: an end-to-end agile design framework for diffractive optical neural networks;and Sleuth: a trace-based root cause analysis system for large-scale microservices with graph neural networks.
Polyglot programming, the use of multiple programming languages during the development process, is common practice in modern software development. this study investigates this practice through a randomized controlled ...
详细信息
ISBN:
(纸本)9781450370431
Polyglot programming, the use of multiple programming languages during the development process, is common practice in modern software development. this study investigates this practice through a randomized controlled trial conducted under the context of database programming. Participants in the study were given coding tasks written in Java and one of three SQL-like embedded languages. One was plain SQL in strings, one was in Java only, and the third was a hybrid embedded language that was closer to the host language. We recorded 109 valid data points. Results showed significant differences in how developers of different experience levels code using polyglot techniques. Notably, less experienced programmers wrote correct programs faster in the hybrid condition (frequent, but less severe, switches), while more experienced developers that already knew bothlanguages performed better in traditional SQL (less frequent, but more complete, switches). the results indicate that the productivity impact of polyglot programming is complex and experience level dependent.
暂无评论