CiNii 図書 - The organization of reduction, data flow, and control flow systems

In light of research during the 1980s on new ways of representing and performing computations, this book provides a reexamination of computer organization and computer architecture. It investigates the basic organizational concepts of reduction, data flow, and control flow (or state transition) and their relationship to the underlying programming paradigms. For each of these concepts, Kluge looks at how principles of language organization translate into architectures and how architectural features translate into concrete system implementations, comparing them in order to identify their similarities and differences. The focus is primarily on a functional programming paradigm, and on its realization by various reduction systems. Kluge first presents a brief outline of the overall configuration of a computing system and of an operating system kernel, introduce elements of the theory of Petri-nets as modelling tools for nonsequential systems and processes, and use a simple form of higher-order Petri nets to identify by means of examples the operational and control disciplines that govern the organization of reduction, data flow, and control flow computations. He then introduces the notions of abstract algorithms and of reductions and includes an overview of the theory. The next five chapters describe the various computing engines that realize the reduction semantics. The remaining chapters provide self-contained investigations of the G-machine, SKI combinator reduction, and the data flow approach for implementing the functional programming paradigm. This is followed by a detailed description of a typical control flow (or von Neumann) machine architecture (a VAX-11 system). Properties of these machines are summarized in the concluding chapter, which classifies them acording to the semantic models they support.

Part 1 Resource management: programmes and processes
process scheduling
memory management. Part 2 Abstract models for processes and systems: conditions, events and cases
condition/event (CE-) systems
predicate-transition (PrT-) Nets. Part 3 Models of computation: a functional model
control by demand
control by availability
control flow
a preliminary classification of computational models. Part 4 Abstract algorithms, reduction and the lambda-calculus: function equations as abstract algorithms
the concept of reduction
the lambda-calculus. Part 5 The mechanization of a full-fledged lambda-calculus: a machine-level reduction language
a string reduction engine. Part 6 Performing reductions concurrently: controlling the Division of workload
a system configuration
the reduction of pseudo-applications
process scheduling. Part 7 Some language issues: converting high-level programmes into OREL/0 expressions
operations on structured objects. Part 8 An eager graph reduction engine: the basic programme execution cycle
supercombinator reduction
pre- and post-processing
the configuration of a hardware machine
concurrent processing re-examined. Part 9 A lazy graph reduction engine: the implementation of lazy graph reduction
run-time support for full-fledged Beta-reductions
a critical assessment. Part 10 Compiling functional languages: the G-machine
SKI combinator reduction
other abstract machines for compiled functional languages. Part 11 Data flow systems: basic language issues
data flow execution models
a tagged token data flow system
streams
some complementary remarks. Part 12 Control flow systmes: an imperative kernel language
basic organization of a control flow engine
a control flow architecture
assembler programming
a case study - quicksorting
some pragmatic aspects of control flow architectures
a note on concurrent programming control flow style.

「Nielsen BookData」より

The organization of reduction, data flow, and control flow systems

著者

書誌事項

大学図書館所蔵全8件

この図書・雑誌をさがす

注記

内容説明・目次

関連文献： 1件中 1-1を表示

詳細情報

書き出し