Results 1  10
of
31
MULTIPROCESSOR SCHEDULING TO ACCOUNT FOR INTERPROCESSOR COMMUNICATION
, 1991
"... Interprocessor communication (PC) overheads have emerged as the major performance limitation in parallel processing systems, due to the transmission delays, synchronization overheads, and conflicts for shared communication resources created by data exchange. Accounting for these overheads is essenti ..."
Abstract

Cited by 69 (11 self)
 Add to MetaCart
Interprocessor communication (PC) overheads have emerged as the major performance limitation in parallel processing systems, due to the transmission delays, synchronization overheads, and conflicts for shared communication resources created by data exchange. Accounting for these overheads is essential for attaining efficient hardware utilization. This thesis introduces two new compiletime heuristics for scheduling precedence graphs onto multiprocessor architectures, which account for interprocessor communication overheads and interconnection constraints in the architecture. These algorithms perform scheduling and routing simultaneously to account for irregular interprocessor interconnections, and schedule all communications as well as all computations to eliminate shared resource contention. The first technique, called dynamiclevel scheduling, modifies the classical HLFET list scheduling strategy to account for IPC and synchronization overheads. By using dynamically changing priorities to match nodes and processors at each step, this technique attains an equitable tradeoff between load balancing and interprocessor communication cost. This method is fast, flexible, widely targetable, and displays promising perforrnance. The second technique, called declustering, establishes a parallelism hierarchy upon the precedence graph using graphanalysis techniques which explicitly address the tradeoff between exploiting parallelism and incurring communication cost. By systematically decomposing this hierarchy, the declustering process exposes parallelism instances in order of importance, assuring efficient use of the available processing resources. In contrast with traditional clustering schemes, this technique can adjust the level of cluster granularity to suit the characteristics of the specified architecture, leading to a more effective solution.
evolution and application of functional programming languages
 ACM Computing surveys
, 1989
"... The foundations of functional programming languages are examined from both historical and technical perspectives. Their evolution is traced through several critical periods: early work on lambda calculus and combinatory calculus, Lisp, Iswim, FP, ML, and modern functional languages such as Miranda ’ ..."
Abstract

Cited by 46 (0 self)
 Add to MetaCart
The foundations of functional programming languages are examined from both historical and technical perspectives. Their evolution is traced through several critical periods: early work on lambda calculus and combinatory calculus, Lisp, Iswim, FP, ML, and modern functional languages such as Miranda ’ and Haskell. The fundamental premises on which the functional programming methodology stands are critically analyzed with respect to philosophical, theoretical, and pragmatic concerns. Particular attention is paid to the main features that characterize modern functional languages: higherorder functions, lazy evaluation, equations and pattern matching, strong static typing and type inference, and data abstraction. In addition, current research areassuch as parallelism, nondeterminism, input/output, and stateoriented computationsare examined with the goal of predicting the future development and application of functional languages.
The Impact of the Lambda Calculus in Logic and Computer Science
 BULLETIN OF SYMBOLIC LOGIC
, 1997
"... One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the represent ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.
Single Assignment C  Entwurf und Implementierung einer CVariante mit spezieller Unterstützung shapeinvarianter ArrayOperationen
, 1996
"... ..."
Three implementation models for Scheme
, 1987
"... This dissertation presents three implementation models for the Scheme Programming Language. The first is a heapbased model used in some form in most Scheme implementations to date; the second is a new stackbased model that is considerably more efficient than the heapbased model at executing most ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This dissertation presents three implementation models for the Scheme Programming Language. The first is a heapbased model used in some form in most Scheme implementations to date; the second is a new stackbased model that is considerably more efficient than the heapbased model at executing most programs; and the third is a new stringbased model intended for use in a multipleprocessor implementation of Scheme. The heapbased model allocates several important data structures in a heap, including actual parameter lists, binding environments, and call frames. The stackbased model allocates these same structures on a stack whenever possible. This results in Jess heap allocation, fewer memory references, shorter instruction sequences, less garbage collection, and more efficient use of memory. The stringbased model allocates versions of these structures right in the program text, which is represented as a string of symbols. In the stringbased model, Scheme programs are translated into an FFP language designed specifically to support Scheme. Programs in this language are directly executed by the
PolyGP: a polymorphic genetic programming system in haskell
 Proc. of the 3rd Annual Conf. Genetic Programming
, 1998
"... In general, the machine learning process can be accelerated through the use of additional knowledge about the problem solution. For example, monomorphic typed Genetic Programming (GP) uses type information to reduce the search space and improve performance. Unfortunately, monomorphic typed GP also l ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
In general, the machine learning process can be accelerated through the use of additional knowledge about the problem solution. For example, monomorphic typed Genetic Programming (GP) uses type information to reduce the search space and improve performance. Unfortunately, monomorphic typed GP also loses the generality of untyped GP: the generated programs are only suitable for inputs with the specified type. Polymorphic typed GP improves over monomorphic and untyped GP by allowing the type information to be
Types in logic and mathematics before 1940
 Bulletin of Symbolic Logic
, 2002
"... Abstract. In this article, we study the prehistory of type theory up to 1910 and its development between Russell and Whitehead’s Principia Mathematica ([71], 1910–1912) and Church’s simply typed λcalculus of 1940. We first argue that the concept of types has always been present in mathematics, thou ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Abstract. In this article, we study the prehistory of type theory up to 1910 and its development between Russell and Whitehead’s Principia Mathematica ([71], 1910–1912) and Church’s simply typed λcalculus of 1940. We first argue that the concept of types has always been present in mathematics, though nobody was incorporating them explicitly as such, before the end of the 19th century. Then we proceed by describing how the logical paradoxes entered the formal systems of Frege, Cantor and Peano concentrating on Frege’s Grundgesetze der Arithmetik for which Russell applied his famous paradox 1 and this led him to introduce the first theory of types, the Ramified Type Theory (rtt). We present rtt formally using the modern notation for type theory and we discuss how Ramsey, Hilbert and Ackermann removed the orders from rtt leading to the simple theory of types stt. We present stt and Church’s own simply typed λcalculus (λ→C 2) and we finish by comparing rtt, stt and λ→C. §1. Introduction. Nowadays, type theory has many applications and is used in many different disciplines. Even within logic and mathematics, there are many different type systems. They serve several purposes, and are formulated in various ways. But, before 1903 when Russell first introduced
An Analysis of the Impact of Functional Programming Techniques on Genetic Programming
, 1999
"... Genetic Programming (GP) automatically generates computer programs to solve specified problems. It develops programs through the process of a “createtestmodify ” cycle which is similar to the way a human writes programs. There are various functional programming techniques that human programmers c ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Genetic Programming (GP) automatically generates computer programs to solve specified problems. It develops programs through the process of a “createtestmodify ” cycle which is similar to the way a human writes programs. There are various functional programming techniques that human programmers can use to accelerate the program development process. This research investigated the applicability of some of the functional techniques to GP and analyzed their impact on GP performance. Among many important functional techniques, three were chosen to be included in this research, due to their relevance to GP. They are polymorphism, implicit recursion and higherorder functions. To demonstrate their applicability, a GP system was developed with those techniques incorporated. Furthermore, a number of experiments were conducted using the system. The results were then compared to those generated by other GP systems which do not support these functional features. Finally, the program search space of the general evenparity problem was analyzed to explain how these techniques impact GP performance. The experimental results showed that the investigated functional techniques have made GP more powerful in the following ways: 1) polymorphism has enabled GP to solve problems that are very difficult for standard GP to solve, i.e. nth and map programs; 2) higherorder functions and implicit recursion have enhanced GP’s ability in solving the general evenparity problem to a greater degree than with any other known methods. Moreover, the analysis showed that these techniques directed GP to generate program solutions in a way that has never been previously reported. Finally, we provide the guidelines for the application of these techniques to other problems.
AN ALGEBRA OF FIXPOINTS FOR CHARACTERIZING INTERACTIVE BEHAVIOR OF INFORMATION SYSTEMS
, 2001
"... ..."
Map Calculus in GIS: a proposal and demonstration
"... This paper provides a new representation for fields (continuous surfaces) in Geographical Information Systems (GIS), based on the notion of spatial functions and their combinations. Following Tomlin’s (1990) Map Algebra, the term “Map Calculus” is used for this new representation. In Map Calculus, G ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper provides a new representation for fields (continuous surfaces) in Geographical Information Systems (GIS), based on the notion of spatial functions and their combinations. Following Tomlin’s (1990) Map Algebra, the term “Map Calculus” is used for this new representation. In Map Calculus, GIS layers are stored as functions, and new layers can be created by combinations of other functions. This paper explains the principles of Map Calculus and demonstrates the creation of functionbased layers and their supporting management mechanism. The proposal is based on Church’s (1941) Lambda Calculus and elements of functional computer languages (such as Lisp or Scheme).