Filters








236,500 Hits in 4.5 sec

Self-Adjusting Computation [chapter]

Robert Harper
2004 Lecture Notes in Computer Science  
This thesis investigates a model of computation, called self-adjusting computation, where computations adjust to any external change to their data (state) automatically.  ...  The techniques make writing self-adjusting programs nearly as easy as ordinary (non-self-adjusting) programs.  ...  A Library for Self-Adjusting Computation We show that our techniques are practical by implementing an ML library to support self-adjusting computation, implementing our list applications based on this  ... 
doi:10.1007/978-3-540-27836-8_1 fatcat:6tqe22fqhbejvna265jg7mddwa

Self-adjusting computation

Umut A. Acar
2008 Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation - PEPM '09  
This thesis investigates a model of computation, called self-adjusting computation, where computations adjust to any external change to their data (state) automatically.  ...  The techniques make writing self-adjusting programs nearly as easy as ordinary (non-self-adjusting) programs.  ...  A Library for Self-Adjusting Computation We show that our techniques are practical by implementing an ML library to support self-adjusting computation, implementing our list applications based on this  ... 
doi:10.1145/1480945.1480946 dblp:conf/pepm/Acar09 fatcat:dkt7ohj7zffjhgojqgn3pl4lwq

Self-adjusting computation

R. Harper
2004 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.  
This thesis investigates a model of computation, called self-adjusting computation, where computations adjust to any external change to their data (state) automatically.  ...  The techniques make writing self-adjusting programs nearly as easy as ordinary (non-self-adjusting) programs.  ...  A Library for Self-Adjusting Computation We show that our techniques are practical by implementing an ML library to support self-adjusting computation, implementing our list applications based on this  ... 
doi:10.1109/lics.2004.1319619 dblp:conf/lics/Harper04 fatcat:vvjwu4dq6nd7hpqgfhpk63pjrq

Imperative self-adjusting computation

Umut A. Acar, Amal Ahmed, Matthias Blume
2008 SIGPLAN notices  
All previous work on self-adjusting computation, however, relied on a purely functional programming model.  ...  Recent work on self-adjusting computation showed how to systematically write programs that respond efficiently to incremental changes in their inputs.  ...  Programming with "Mutable Modifiables" We give an overview of our framework based on our ML library and a self-adjusting version of depth-first-search trees on graphs. The ML library.  ... 
doi:10.1145/1328897.1328476 fatcat:af627tpl3vhmrhapxexzflorha

Imperative self-adjusting computation

Umut A. Acar, Amal Ahmed, Matthias Blume
2008 Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '08  
All previous work on self-adjusting computation, however, relied on a purely functional programming model.  ...  Recent work on self-adjusting computation showed how to systematically write programs that respond efficiently to incremental changes in their inputs.  ...  Programming with "Mutable Modifiables" We give an overview of our framework based on our ML library and a self-adjusting version of depth-first-search trees on graphs. The ML library.  ... 
doi:10.1145/1328438.1328476 dblp:conf/popl/AcarAB08 fatcat:c75hhva3cvdp3d5yp6xx3guxti

Non-monotonic Self-Adjusting Computation [chapter]

Ruy Ley-Wild, Umut A. Acar, Guy Blelloch
2012 Lecture Notes in Computer Science  
Self-adjusting computation is a language-based approach to writing programs that respond dynamically to input changes by maintaining a trace of the computation consistent with the input, thus also updating  ...  For monotonic programs, i.e. where localized input changes cause localized changes in the computation, the trace can be repaired efficiently by insertions and deletions.  ...  Overview We illustrate how non-local input changes can cause computation reordering with a pure, self-adjusting map program on lists: Ø ØÝÔ 'a cell = nil | :: Ó 'a * 'a list Û Ø ØÝÔ 'a list = 'a cell ref  ... 
doi:10.1007/978-3-642-28869-2_24 fatcat:payxcagbwrez7mmcqwkrmc4db4

Self-adjusting Computation with Delta ML [chapter]

Umut A. Acar, Ruy Ley-Wild
2009 Lecture Notes in Computer Science  
In self-adjusting computation, programs respond automatically and efficiently to modifications to their data by tracking the dynamic data dependencies of the computation and incrementally updating the  ...  In this tutorial, we describe the self-adjustingcomputation model and present the language SaSML (Self-Adjusting SML) for writing self-adjusting programs.  ...  The Programming Model: An Overview In self-adjusting computation programs are stratified into two components: a self-adjusting program (core) and a top-level mutator.  ... 
doi:10.1007/978-3-642-04652-0_1 fatcat:4kkfaztuyjaktgtpzi6sbxbvii

Memory management for self-adjusting computation

Matthew A. Hammer, Umut A. Acar
2008 Proceedings of the 7th international symposium on Memory management - ISMM '08  
our approach • Compare to previous SML framework Matthew Hammer Memory Management for Self-Adjusting Computation 2 / 42 Self-Adjusting Computation Motivation : Incremental change is pervasive.  ...  Overview of Talk • Previous frameworks written in SML • We implement a framework for C In this talk, we • Briefly review self-adjusting computation • Discuss memory management issues • Introduce and evaluate  ...  • The input is stored in a modref • We have to read it to see a list cell • We are given an empty modref to write the output Matthew Hammer Memory Management for Self-Adjusting Computation  ... 
doi:10.1145/1375634.1375642 dblp:conf/iwmm/HammerA08 fatcat:6nozipm7frad3jkskutk37rmlm

Kinetic Algorithms Via Self-adjusting Computation [chapter]

Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes
2006 Lecture Notes in Computer Science  
Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects.  ...  In this paper, we describe a technique for syntactically transforming static algorithms into kinetic algorithms, which compute properties of moving objects.  ...  The self-adjusting-computation library is described elsewhere [3, 2] .  ... 
doi:10.1007/11841036_57 fatcat:yl67u273mndvllpqukydqtee2a

Streaming big data with self-adjusting computation

Umut A. Acar, Yan Chen
2013 Proceedings of the 2013 workshop on Data driven functional programming - DDFP '13  
In this paper, we propose an approach based on self-adjusting computation that can dramatically improve the efficiency of such computations.  ...  As an example, we can perform the aforementioned streaming computation in just a couple of minutes.  ...  Self-Adjusting Computation Overview.  ... 
doi:10.1145/2429376.2429382 dblp:conf/popl/AcarC12 fatcat:bfufhf354zchjaalfnfoym6wk4

Autonomic Computing: An Overview [chapter]

Manish Parashar, Salim Hariri
2005 Lecture Notes in Computer Science  
This paper presents an introduction to autonomic computing, its challenges, and opportunities.  ...  Introduction Advances in networking and computing technology and software tools have resulted in an explosive growth in networked applications and information services that cover all aspects of our life  ...  We then outline the key challenges of autonomic computing and present an overview of existing autonomic computing systems and applications.  ... 
doi:10.1007/11527800_20 fatcat:zafwpgs46newlitm3mcnetqbz4

Traceable data types for self-adjusting computation

Umut A. Acar, Guy Blelloch, Ruy Ley-Wild, Kanat Tangwongsan, Duru Turkoglu
2010 SIGPLAN notices  
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifications through the computation  ...  Current approaches to self-adjusting computation guarantee correctness by recording dependencies in a trace at the granularity of individual memory operations.  ...  Self-Adjusting Computation. Self-adjusting computation combines dynamic dependence graphs [2] and a form of computation memoization [5] to achieve efficient updates.  ... 
doi:10.1145/1809028.1806650 fatcat:sivghn244ve3tgwuff422f5zty

Traceable data types for self-adjusting computation

Umut A. Acar, Guy Blelloch, Ruy Ley-Wild, Kanat Tangwongsan, Duru Turkoglu
2010 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation - PLDI '10  
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifications through the computation  ...  Current approaches to self-adjusting computation guarantee correctness by recording dependencies in a trace at the granularity of individual memory operations.  ...  Self-Adjusting Computation. Self-adjusting computation combines dynamic dependence graphs [2] and a form of computation memoization [5] to achieve efficient updates.  ... 
doi:10.1145/1806596.1806650 dblp:conf/pldi/AcarBLTT10 fatcat:olkft5pnabhahk3gw7bh7ir74u

An experimental analysis of self-adjusting computation

Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper, Kanat Tangwongsan
2009 ACM Transactions on Programming Languages and Systems  
We refer to this approach as self-adjusting computation.  ...  We show that the proposed approach is realistic by describing a library for self-adjusting computation, presenting efficient algorithms for realizing the library, and describing and evaluating an implementation  ...  memoization (Section 2 presents an overview).  ... 
doi:10.1145/1596527.1596530 fatcat:vmcusq2xdfb77mwxn5zimf52d4

An experimental analysis of self-adjusting computation

Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kanat Tangwongsan
2006 SIGPLAN notices  
We refer to this approach as self-adjusting computation.  ...  We show that the proposed approach is realistic by describing a library for self-adjusting computation, presenting efficient algorithms for realizing the library, and describing and evaluating an implementation  ...  memoization (Section 2 presents an overview).  ... 
doi:10.1145/1133255.1133993 fatcat:2nn4zxjjmrgjbgdl4ge73vhfgm
« Previous Showing results 1 — 15 out of 236,500 results