Filters








13,140 Hits in 3.3 sec

A unified approach to fully lazy sharing

Thibaut Balabonski
2012 SIGPLAN notices  
We give an axiomatic presentation of sharing-via-labelling for weak λ-calculi, that allows to formally compare many different approaches to fully lazy sharing, and obtain two important results.  ...  We establish a link between the optimality theories of weak λ-calculi and first-order rewriting systems by expressing fully lazy λ-lifting in our framework, thus emphasizing the first-order essence of  ...  Acknowledgements The author would like to thank Delia Kesner for her continuous support, Vincent van Oostrom for a mysterious but insightful remark that triggered this investigation, and the anonymous  ... 
doi:10.1145/2103621.2103713 fatcat:qbknbhelljglfnj3qp4sxzr4iu

A unified approach to fully lazy sharing

Thibaut Balabonski
2012 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12  
We give an axiomatic presentation of sharing-via-labelling for weak λ-calculi, that allows to formally compare many different approaches to fully lazy sharing, and obtain two important results.  ...  We establish a link between the optimality theories of weak λ-calculi and first-order rewriting systems by expressing fully lazy λ-lifting in our framework, thus emphasizing the first-order essence of  ...  Acknowledgements The author would like to thank Delia Kesner for her continuous support, Vincent van Oostrom for a mysterious but insightful remark that triggered this investigation, and the anonymous  ... 
doi:10.1145/2103656.2103713 dblp:conf/popl/Balabonski12 fatcat:t7gpelrj6rejhk6g3j4bb3msii

Unification with lazy non-redundant copying

Martin C. Emele
1991 Proceedings of the 29th annual meeting on Association for Computational Linguistics -  
This paper presents a unification procedure which eliminates the redundant copying of structures by using a lazy incremental copying appr0a~:h to achieve structure sharing.  ...  Lazy Incremental Copying (LIC) is presented as a new solution to the copying problem.  ...  Lazy Incremental Copying We now present Lazy Incremental Copying (LIC) as a new approach to the copying problem.  ... 
doi:10.3115/981344.981386 dblp:conf/acl/Emele91 fatcat:bqyuyvdrtnf5padvb5s4nrnmku

Agent coordination and control through logic theories [chapter]

Andrea Omicini, Enrico Denti, Antonio Natali
1995 Lecture Notes in Computer Science  
In order to promote a knowledge-based approach to agent interaction, new communication abstractions have been proposed, such as the concept of blackboard [1] or the idea of a tuple space as a (generative  ...  As a result, the traditional dichotomy between reactive and symbolic systems is here exploited as a feature rather than a problem, leading to an integration of behavioural and planning-based approaches  ...  Fig. 1 . 1 Speedy (a) and lazy (b) mouse code Fig. 2 . 2 Speedy (a) and lazy (b) mouse paths in a 5x5 grid Figures 2 refer to the simple case of two agents (one speedy and one lazy mouse), both starting  ... 
doi:10.1007/3-540-60437-5_43 fatcat:bhudyiri3rcqhplt4fuuvwkbv4

Configurable Version Management Hardware Transactional Memory for Multi-processor Platform

Jeevan Sirkunan, Chia Yee Ooi, N. Shaikh Husin, Yuan Wen Hau, Trias Andromeda, M. N. Marsono
2014 Proceeding of the Electrical Engineering Computer Science and Informatics  
Programming on a shared memory multiprocessor platforms in an efficient way is difficult as locked based synchronization limits the efficiency.  ...  Transactional memory (TM) is a promising approach in creating an abstraction layer for multi-threaded programming. However, the performance of TM is application-specific.  ...  In our design, we use a fully associative buffer to reduce the address search time to one clock cycle.  ... 
doi:10.11591/eecsi.v1.409 fatcat:ib6yhnddnrcnndxhe3wjmwidoa

GPU-accelerated data management under the test of time

Aunn Raza, Periklis Chrysogelos, Panagiotis Sioulas, Vladimir Indjic, Angelos Christos Anadiotis, Anastasia Ailamaki
2020 Zenodo  
We demonstrate that the standard PCIe interconnect substantially limits the performance of state-of-the-art GPUs and we propose a hybrid materialization approach which combines eager with lazy data transfers  ...  However, this acceleration comes at the price of a slow interconnect which imposes strong restrictions in bandwidth and latency when bringing data from the main memory to the GPU for processing.  ...  One approach is to access the main memory directly from the kernels, over the interconnect, by taking advantage of the unified address space for the main memory and the GPU memory.  ... 
doi:10.5281/zenodo.3827489 fatcat:wi4xpncbgjdino7r67rxoouhla

Lazy Stream Programming in Prolog

Paul Tarau, Jan Wielemaker, Tom Schrijvers
2019 Electronic Proceedings in Theoretical Computer Science  
To remedy this situation, we present lazy stream generators as a unified Prolog interface for stateful computations on both finite and infinite sequences of data that are produced incrementally through  ...  In recent years, stream processing has become a prominent approach for incrementally handling large amounts of data, with special support and libraries in many programming languages.  ...  While monadic constructs in functional languages [10, 18] offer a unified view of declarative and procedural state-management operations, most logic programming languages still lack a unified approach  ... 
doi:10.4204/eptcs.306.26 fatcat:bvwx5zl52rantnkj4mdqbslcwq

A Dynamically Adaptable Hardware Transactional Memory

Marc Lupon, Grigorios Magklis, Antonio Gonzalez
2010 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture  
In addition, lazy transactions share the majority of hardware support with eager transactions, reducing substantially the hardware cost compared to other lazy HTM systems.  ...  In the heart of DynTM is a novel coherence protocol that allows tracking conflicts among eager and lazy transactions.  ...  By providing a fully-flexible version and conflict management implementation, DynTM allows the system to dynamically adapt its policies to best suit the application behavior.  ... 
doi:10.1109/micro.2010.23 dblp:conf/micro/LuponMG10 fatcat:7i232v5kwfhs7cknn5wfgwylg4

Efficient Parameterizable Type Expansion for Typed Feature Formalisms

Hans-Ulrich Krieger, Ulrich Schäfer
1995 International Joint Conference on Artificial Intelligence  
language processing and computational linguistics From the viewpoint of computer science typed feature structures can be seen as data structures that allow the representation of linguistic knowledge in a  ...  uniform fashion Type expansion is an operation that makes constraints of a typed feature structure explicit and determines its satisfiability We describe an efficient expansion algorithm that takes care  ...  both cases for constructing a fully specified feature structure which it?  ... 
dblp:conf/ijcai/KriegerS95 fatcat:ueaibhk4inenzk5ie7yn5owzuu

Coupling committed and trial binding resolution engines

Hamish Taylor
1991 Data & Knowledge Engineering  
However, their use of committed choice resolution makes them unable to support a knowledge base querying capability.  ...  The ability of sequential and parallel Prologs to implement don't know non-determinism in resolution efficiently makes them apt for supporting a knowledge base querying capability.  ...  This restriction fits in better with a loose approach to sharing variables using two way copying across the CLP-Prolog divide rather than with Clark and Gregory's tight approach to sharing variables via  ... 
doi:10.1016/0169-023x(91)90021-o fatcat:l2eqmxaolbdg5n3mosdasffkaa

GAIA: An OS Page Cache for Heterogeneous Systems

Tanya Brokhman, Pavel Lifshits, Mark Silberstein
2019 USENIX Annual Technical Conference  
We propose a principled approach to integrating GPU memory with an OS page cache. We design GAIA, a weakly-consistent page cache that spans CPU and GPU memories.  ...  GAIA enables the standard mmap system call to map files into the GPU address space, thereby enabling data-dependent GPU accesses to large files and efficient write-sharing between the CPU and GPUs.  ...  We propose a unified page cache which eliminates false sharing by using a lazy release consistency model [22, 10] . • We extend the OS page cache to control the unified (CPU and GPU) page cache and its  ... 
dblp:conf/usenix/BrokhmanLS19 fatcat:imcpoceqtrbgzplty7ul2xltx4

Foreword: special issue on term and graph rewriting

RACHID ECHAHED
2018 Mathematical Structures in Computer Science  
During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international workshops editions of TERMGRAPH and  ...  Rewriting techniques constitute a foundational theory of computing science.  ...  of lazy evaluation: nonstrictness and sharing.  ... 
doi:10.1017/s0960129518000191 fatcat:h4bmulx6wbba7mdjbnkwmhzyti

Lazy Scheduling

Alexandros Tzannes, George C. Caragea, Uzi Vishkin, Rajeev Barua
2014 ACM Transactions on Programming Languages and Systems  
Lazy scheduling is a runtime scheduler for task-parallel codes that effectively coarsens parallelism on load conditions in order to significantly reduce its overheads compared to existing approaches, thus  ...  performance very close to that of fully tuned code.  ...  Sanchez et al. [2010] seem to share our opinion and propose Asynchronous Direct Messages (ADM), a lightweight core-to-core messaging hardware mechanism that is fully virtualizable.  ... 
doi:10.1145/2629643 fatcat:q66sbmv24bbupgci2kpbahbag4

Mapping Out a Path from Hardware Transactional Memory to Speculative Multithreading

Leo Porter, Bumyong Choi, Dean M. Tullsen
2009 2009 18th International Conference on Parallel Architectures and Compilation Techniques  
The result is a unified memory architecture capable of effective support for transactional parallel workloads and efficient speculative multithreading.  ...  This research demonstrates that coming support for hardware transactional memory can be leveraged to significantly reduce the cost of implementing true speculative multithreading.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their helpful insights. This research was supported in  ... 
doi:10.1109/pact.2009.37 dblp:conf/IEEEpact/PorterCT09 fatcat:4ldki34k4ncyjc4sfukl2gqbsy

A semantics for tracing declarative multi-paradigm programs

B. Brassel, M. Hanus, F. Huch, G. Vidal
2004 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '04  
In contrast to previous approaches, which rely solely on a transformation to instrument source programs, the formal definition of a tracing semantics improves the understanding of the tracing process.  ...  Tracing computations is a difficult task due to the subtleties of the underlying operational semantics which combines laziness and non-determinism.  ...  Acknowledgments We would like to thank Santiago Escobar for many helpful comments and discussions on an earlier version of this paper.  ... 
doi:10.1145/1013963.1013984 dblp:conf/ppdp/BrasselHHV04 fatcat:o6yzgdowyjcenm7uqho5ku5f7a
« Previous Showing results 1 — 15 out of 13,140 results