Filters








6,658 Hits in 10.8 sec

Strictness optimization for graph reduction machines (why id might not be strict)

Marcel Beemster
1994 ACM Transactions on Programming Languages and Systems  
Optimization for Graph Reduction Ivlachlnes . 1465 lazy graph reduction.  ...  The situation is now as in Figure 3 (d 'This leads to the following conclusions: (1) Implementations of graph reduction, including G-machine-style implementations, that do not make use of strictness analysis  ... 
doi:10.1145/186025.186040 fatcat:q4emkta32vgxblaqqrfeisnhnu

Application of the Polytope Model to Functional Programs [chapter]

Nils Ellmenreich, Christian Lengauer, Martin Griebl
2000 Lecture Notes in Computer Science  
We describe the prerequisites for adapting the polytope model to Haskell, a non-strict functional language.  ...  The programming of parallel machines remains di cult, even though new languages are being developed every year. They often follow the imperative paradigm, enriched with low-level parallel directives.  ...  Acknowledgments The authors would like to thank John O'Donnell for reading the draft and lots of helpful comments, especially on Section 2.2, Bj orn Lisper for fruitful discussions and the DAAD for travel  ... 
doi:10.1007/3-540-44905-1_14 fatcat:zpi6cjpeb5bmfh6duotvoqwp7a

Functional Programs as Executable Specifications [and Discussion]

D. A. Turner, J. Fairbairn, D. Park, P. Wadler, B. A. Wichmann, M. H. Rogers
1984 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
Comparison with the G-machine Another well known abstract machine for graph reduction is the G-machine [Johnson 84 ].  ...  The instr-id stored in a node can be changed during reduction. This is used for several markings of the node.  ...  I Associates an index in the Α-stack frame to a node-id I An index in the Α-stack frame I Associates the status of the node to a node-id I The states possible I This node-id is not defined in the current  ... 
doi:10.1098/rsta.1984.0065 fatcat:s2jq4lnauvfdzd5alqp2stsxsm

Compiling language definitions: the ASF+SDF compiler

M. G. J. Van Den Brand, J. Heering, P. Klint, P. A. Olivier
2002 ACM Transactions on Programming Languages and Systems  
machine interface bottlenecks.  ...  The ASF+SDF rewrite rule compiler generates C code, thus taking advantage of C's portability and the sophisticated optimization capabilities of current C compilers as well as avoiding potential abstract  ...  version of the ASF+SDF compiler, Wan Fokkink for his useful remarks, and Pierre-Etienne Moreau for discussions on the compilation of term rewriting systems in general.  ... 
doi:10.1145/567097.567099 fatcat:esq4htdlejejhfljvpbgrbdrk4

Compiling Language Definitions: The ASF+SDF Compiler [article]

M. G. J. van den Brand, J. Heering, P. Klint, P. A. Olivier
2000 arXiv   pre-print
machine interface bottlenecks.  ...  The ASF+SDF rewrite rule compiler generates C code, thus taking advantage of C's portability and the sophisticated optimization capabilities of current C compilers as well as avoiding potential abstract  ...  ACKNOWLEDGMENTS We would like to thank Hayco de Jong for his contribution to the implementation of the ATerm library, Jurgen Vinju for looking into the efficiency of list matching, Wan Fokkink for his  ... 
arXiv:cs/0007008v1 fatcat:tfs5zi4ofzb6rmskbf7shs7ioy

Resource Management in Dataflow-Based Multithreaded Execution

Lucas Roh, Bhanu Shankar, Wim Böhm, Walid Najjar
2001 Journal of Parallel and Distributed Computing  
At the same time it increases the potential for exploitation of program data structure locality.  ...  The methods are in themselves not new, but their performance analysis is. The two methods to control parallelism here are slicing and chunking.  ...  This is why some of the Livermore loops are not used at this time. The problem can be solved by reusing frameslots for variables that do not live at the same time.  ... 
doi:10.1006/jpdc.2001.1708 fatcat:3njueowswbacxfdcl73357fwai

Programming slick network functions

Bilal Anwer, Theophilus Benson, Nick Feamster, Dave Levin
2015 Proceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research - SOSR '15  
or how traffic should be routed through them.  ...  Current approaches to in-network traffic processing involve the deployment of monolithic middleboxes in virtual machines.  ...  Acknowledgments We thank Jennifer Rexford for her thoughtful comments throughput the course of this project. This work was supported by DARPA through the U.S.  ... 
doi:10.1145/2774993.2774998 dblp:conf/sosr/AnwerBFL15 fatcat:hf274jcuczfavas7s6rhywjfp4

Balanced label propagation for partitioning massive graphs

Johan Ugander, Lars Backstrom
2013 Proceedings of the sixth ACM international conference on Web search and data mining - WSDM '13  
Partitioning graphs at scale is a key challenge for any application that involves distributing a graph across disks, machines, or data centers.  ...  Because this requires assigning each node in a graph to a physical machine with memory limitations, it is critically necessary to ensure the resulting partition shards do not overload any single machine  ...  For example, on the web one might use domain, or in a computer network one might use IP-address.  ... 
doi:10.1145/2433396.2433461 dblp:conf/wsdm/UganderB13 fatcat:lrh5g27vnvcybkgn65zoqyrt4u

Cobra: Making Transactional Key-Value Stores Verifiably Serializable

Cheng Tan, Changgeng Zhao, Shuai Mu, Michael Walfish
2020 USENIX Symposium on Operating Systems Design and Implementation  
Second, the strict case can degenerate to the non-strict case. Heavy concurrency, for example, means few real-time constraints, so the difficult computational problem re-enters.  ...  As a special case, clock drift causes otherwise ordered transactions to be concurrent ( §3.5, §6.1). (c) Scalability.  ...  We thank the anonymous artifact evaluators for their patience and attention to detail.  ... 
dblp:conf/osdi/TanZMW20 fatcat:bqitghwknnfplkbipjfjydu2ri

The extended prosodic word [chapter]

Junko Ito, Armin Mester
2009 Interface Explorations [IE]  
This makes a strict allomorphy approach less attractive: Not only would all possibilities have to be listed, there would also be no explanation why every level of reduction happens to he lexically precompiled  ...  structures being optimal, depending on the ranking of No-RECURSION (19) (see Ladd 1986 for an argument that intonational phrasing can be recursive).  ... 
doi:10.1515/9783110219234.2.135 fatcat:ixhd7fizwvaxxprlykmq5iwcqy

The extended prosodic word [chapter]

Junko Ito, Armin Mester
2009 Interface Explorations [IE]  
This makes a strict allomorphy approach less attractive: Not only would all possibilities have to be listed, there would also be no explanation why every level of reduction happens to he lexically precompiled  ...  structures being optimal, depending on the ranking of No-RECURSION (19) (see Ladd 1986 for an argument that intonational phrasing can be recursive).  ... 
doi:10.1515/9783110217100.2.135 fatcat:qgtyj7q7gzhllgxldn6ulhpcf4

Parallel Beta Reduction Is Not Elementary Recursive

Andrea Asperti, Harry G. Mairson
2001 Information and Computation  
Optimal evaluation was finally realized by Lamping, who introduced a beautiful graph reduction technology for sharing evaluation contexts dual to the sharing of values.  ...  The main theorem gives a lower bound on the work that must be done by any technology that implements Lévy's notion of optimal reduction.  ...  ACKNOWLEDGMENTS For many relevant and fruitful discussions, suggestions, corrections, admonishments, and encouragements, we thank Arvind, Stefano Guerrini, Paris Kanellakis, Jakov Kucan, Julia Lawall,  ... 
doi:10.1006/inco.2001.2869 fatcat:ha4xzhxoq5ae3fjuj4zgshlblq

Interconvertibility of a class of set constraints and context-free-language reachability

David Melski, Thomas Reps
2000 Theoretical Computer Science  
It also o ers some insight into the "O(n 3 ) bottleneck" for di erent types of program-analysis problems and allows results previously obtained for context-free-language reachability problems to be applied  ...  two formalisms o ers a conceptual advantage akin to the advantage gained from the interconvertibility of ÿnite-state automata and regular expressions in formal language theory, namely, a problem can be  ...  Acknowledgements We are grateful to the referees for their careful reading of, and extensive comments on, the paper. Jon Kleinberg pointed out to us the use of CFL-reachability in Ref. [11] .  ... 
doi:10.1016/s0304-3975(00)00049-9 fatcat:gxbqophixbd3bhyggnefjamkii

Symmetric Iterative Proportional Fitting

Sven Kurras
2015 International Conference on Artificial Intelligence and Statistics  
We prove convergence for both of them. Further, we give a novel characterization for the existence of W in terms of expansion properties of the undirected weighted graph represented by W .  ...  Nowadays, IPF is well-known in machine learning and many other disciplines like statistics, optimization, matrix factorization, economics, or network theory.  ...  The author would like to thank Ulrike von Luxburg and Gilles Blanchard for helpful discussions.  ... 
dblp:conf/aistats/Kurras15 fatcat:g3gkerfnebdchmxt5ogtc4llae

Scenario Graphs Applied to Network Security [chapter]

Jeannette M. Wing
2008 Information Assurance  
Sometimes, however, we would like all counterexamples, not just one. Rather than produce one example of how the model does not satisfy a given property, why not produce all of them at once?  ...  These properties of our scenario graphs are not obvious, in particular for the second algorithm. See [21] for formal definitions and proofs.  ...  Acknowledgments Oleg Sheyner deserves all the credit for the technical contributions summarized in this chapter.  ... 
doi:10.1016/b978-012373566-9.50011-2 fatcat:vpgfppzib5fxbczdjpav4drjpu
« Previous Showing results 1 — 15 out of 6,658 results