Filters








15 Hits in 3.0 sec

Lazy task creation: a technique for increasing the granularity of parallel programs

Eric Mohr, David A. Kranz, Robert H. Halstead
1990 Proceedings of the 1990 ACM conference on LISP and functional programming - LFP '90  
We reject the simpler load-based inlining method, where tasks are combined based on dynamic load level, in favor of the safer and more robust lazy task creation method, where tasks are created only retroactively  ...  In this paper we explore a third approach to the granularity problem by analyzing two strategies for combining parallel tasks dynamically at run-time.  ...  FG02-86ER25012 and DARPA N00014-87-K-0825 for their support.  ... 
doi:10.1145/91556.91631 dblp:conf/lfp/MohrKH90 fatcat:y273dbyqqvb7vfautno2fmivcq

Lazy task creation: a technique for increasing the granularity of parallel programs

E. Mohr, D.A. Kranz, R.H. Halstead
1991 IEEE Transactions on Parallel and Distributed Systems  
We reject the simpler load-based inlining method, where tasks are combined based on dynamic load level, in favor of the safer and more robust lazy task creation method, where tasks are created only retroactively  ...  In this paper we explore a third approach to the granularity problem by analyzing two strategies for combining parallel tasks dynamically at run-time.  ...  FG02-86ER25012 and DARPA N00014-87-K-0825 for their support.  ... 
doi:10.1109/71.86103 fatcat:qqoa2crj4bdxrfo6xu23brcasu

Using the run-time sizes of data structures to guide parallel-thread creation

Lorenz Huelsbergen, James R. Larus, Alexander Aiken
1994 Proceedings of the 1994 ACM conference on LISP and functional programming - LFP '94  
Expressions with little computation relative to thread-creation costs should evaluate sequentially for maximum performance. Static identi cation of such threads is however di cult.  ...  Compiler-inserted checks consult this size information to make thread creation decisions dynamically. We describe dynamic granularity estimation for a list-based functional language.  ...  Huelsbergen was supported by a n A R P A f e l l o wship in parallel processing thanks to John Williams and IBM Almaden for hosting the internship associated with this fellowship.  ... 
doi:10.1145/182409.182442 dblp:conf/lfp/HuelsbergenLA94 fatcat:mthkd6a2nzbvfgh777xqovmbjm

Using the run-time sizes of data structures to guide parallel-thread creation

Lorenz Huelsbergen, James R. Larus, Alexander Aiken
1994 ACM SIGPLAN Lisp Pointers  
Expressions with little computation relative to thread-creation costs should evaluate sequentially for maximum performance. Static identi cation of such threads is however di cult.  ...  Compiler-inserted checks consult this size information to make thread creation decisions dynamically. We describe dynamic granularity estimation for a list-based functional language.  ...  Huelsbergen was supported by a n A R P A f e l l o wship in parallel processing thanks to John Williams and IBM Almaden for hosting the internship associated with this fellowship.  ... 
doi:10.1145/182590.182442 fatcat:oy6fb7o2krdplanelqdx7phzba

Speculative computation in multilisp

Randy B. Osborne
1990 Proceedings of the 1990 ACM conference on LISP and functional programming - LFP '90  
Tasks ae called processes In Qlisp.  ...  (throw tag value) causes value to be "thrown" to the nearest catch in the dynamic task creation chain which matches tag.  ...  The no task state occurs in three cases: 1. After the creation of a future object but before the creation of its task object.  ... 
doi:10.1145/91556.91644 dblp:conf/lfp/Osborne90 fatcat:6mu4zcbzrvgq3ghnuftl7mjcjq

Program Transformation Systems

H. Partsch, R. Steinbrüggen
1983 ACM Computing Surveys  
Interest is increasing in the transformational approach to programming and in mechanical aids for supporting the program development process.  ...  This paper reviews and classifies transformation systems and is intended to acquaint the reader with the current state of the art and provide a basis for comparing the different approaches.  ...  Hyerle, and ACM's technical editor, R. Rutherford, who improved the English formulation, and to M. Kr/imer, I. Dippold, and S. Figura for their excellent and speedy typing.  ... 
doi:10.1145/356914.356917 fatcat:n3fsxgfsgngedkmtflmt7wl4p4

Provably and practically efficient granularity control

Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey
2019 Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming - PPoPP '19  
We implement the oracle in C++ by extending Cilk and evaluate its practical performance.  ...  In this paper, we present provably and practically efficient techniques for controlling granularity within the run-time system of the language.  ...  Joseph Pehoushek and Joseph Weening. 1990. Low-cost process creation and dynamic partitioning in Qlisp. In Parallel Lisp: Languages and Systems, Takayasu Ito and Robert Halstead (Eds.).  ... 
doi:10.1145/3293883.3295725 dblp:conf/ppopp/AcarACR19 fatcat:3lrzgnyfwfepxixn3q2kh7gaqu

Negotiation as a Metaphor for Distributed Problem Solving [chapter]

Randall Davis, Reid G. Smith
2003 Lecture Notes in Computer Science  
Task distribution is viewed as an interactive process, a discussion carried on between a node with a task to be executed and a group of nodes that may be able to execute the task.  ...  We present a framework called the contract net that specifies communication and control in a distributed problem solver.  ...  The assistance of Bruce Buchanan and Ed Feigenbaum in the original development of these ideas is greatefully acknowledged.  ... 
doi:10.1007/978-3-540-44972-0_3 fatcat:ejfhzs6h4jhh5lbmixqilgzbqy

Negotiation as a metaphor for distributed problem solving

Randall Davis, Reid G. Smith
1983 Artificial Intelligence  
Task distribution is viewed as an interactive process, a discussion carried on between a node with a task to be executed and a group of nodes that may be able to execute the task.  ...  We present a framework called the contract net that specifies communication and control in a distributed problem solver.  ...  The assistance of Bruce Buchanan and Ed Feigenbaum in the original development of these ideas is greatefully acknowledged.  ... 
doi:10.1016/0004-3702(83)90015-2 fatcat:zylferpzovev3h5y5do34yndxm

Programming languages for distributed computing systems

Henri E. Bal, Jennifer G. Steiner, Andrew S. Tanenbaum
1989 ACM Computing Surveys  
When distributed systems first appeared, they were programmed in traditional sequential languages, usually with the addition of a few library procedures for sending and receiving messages.  ...  These languages and their history, their underlying principles, their design, and their use are the subject of this paper.  ...  For example, it may be possible to efficiently support fine-grained parallelism in a distributed system with low com-munication costs, such as a hypercube; whereas in a system with high communication costs  ... 
doi:10.1145/72551.72552 fatcat:y2afbdzlpbdgrhutfhgfuhfjmq

Speculative computation in multilisp [chapter]

Randy B. Osborne
Lecture Notes in Computer Science  
Tasks ae called processes In Qlisp.  ...  (throw tag value) causes value to be "thrown" to the nearest catch in the dynamic task creation chain which matches tag.  ...  The no task state occurs in three cases: 1. After the creation of a future object but before the creation of its task object.  ... 
doi:10.1007/bfb0024152 dblp:conf/plisp/Osborne89 fatcat:x7seoz4v75bifhby7gwjpnqdsq

CALCULUS OF FUZZY RESTRICTIONS [chapter]

L.A. Zadeh
1975 Fuzzy Sets and their Applications to Cognitive and Decision Processes  
In terms of such restrictions, the meaning of a proposition of the form "x is P," where x is the name of an object and P is a fuzzy set, may be expressed as a relational assignment equation of the form  ...  The calculus of fuzzy restrictions is concerned, in the main, with (a) translation of propositions of various types into relational assignment equations, and (b) the study of transformations of fuzzy restrictions  ...  Assertion 5. 2 . 2 Creation process as one of the three cognition aspects in information functions is analysed in view of the principles of system formation, and the analysis leads us to a recognition  ... 
doi:10.1016/b978-0-12-775260-0.50006-2 fatcat:zhkupyhimzcaffxqgadlfom2zq

An annotated bibliography of natural language and speech understanding systems

John R. Kender
2018
Low end is based on linear predictive spectral match using Itakura metric. Search is heuristically-modified dynamic programming.  ...  All of Dragon's knowledge sources are probabilistic models of Markov processes, organized in hierarchies; dynamic programming is used to search for the best match.  ... 
doi:10.1184/r1/6603194.v1 fatcat:bek5cfpwtvbbjjr272uwnozb64

The evolution of Lisp [chapter]

Guy L. Steele, Richard P. Gabriel
History of programming languages---II  
The acceptance battle would center around the factors of acceptable computer and acceptable work process. Included in the work process is the nature, cost, and availability of Lisp programmers.  ...  It also relied entirely on futures for the spawning of parallel processes. Qlisp Goldman, 1988] was developed by Richard Gabriel and John McCarthy at Stanford.  ...  Thus the entire iteration process is free of side effects.  ... 
doi:10.1145/234286.1057818 fatcat:cmc3vyusfvcstfqzfce65k7sxq

An intelligent management information system as a test of a formal accounting theory

Bevan J. Clarke
1975
We consider that if computers and their software are to be employed reliably in very complex systems it will become necessary for the design of such a system, its adaptation to changing circumstances and  ...  This is capable of deducing accounting entries and updating an accounting model of the world. It is given as input a narrative or dialogue in ordinary idiomatic English.  ...  And where do these low-level imperatives come from?  ... 
doi:10.14288/1.0100050 fatcat:qzq7anphorcm7na6yqlzsezkxm