Advances in Information Systems Science: Volume 6

ISBN-13: 9781461582519 / Angielski / Miękka / 2012 / 209 str.

Julius T. Tou

Opis

Information systems science is rapidly advancing in many directions. Di- versified ideas, methodologies, and techniques as well as applications have been conceived and developed. This series intends to discuss some of the recent advances in this field. In this volume, we cover four timely topics which are of great current interest. In each chapter, an attempt is made to familiarize the reader with some basic background information on the ad- vances discussed. The emphasis of this volume is placed upon parallel pro- gramming, data structure models in information system design, and the principles of L systems. One of the effective means to enhance computation performance is parallel information processing on multiprocessor systems. In Chapter I, V. E. Kotov discusses the practical aspects of parallel programming. He is concerned with the languages and methods of parallel programming, per- formance an lysis, and automatic synthesis of parallel programs. In Chapter 2, A. S. Narin'yani presents the formal theory of parallel computations. These two chapters attempt to correlate and classify various methods in parallel programming, thus providing the reader with a unified approach to this important subject matter. Data structures play an important role in information system design.

Spis treści

1 Theory of Parallel Programming. I. Survey of Practical Aspects.- 1. Introduction.- 2. Parallel Programming Languages and Methods.- 2.1. Extensions of Sequential Programming Languages.- 2.2. Practical Schemes and Structures for Parallel Programs.- 3. Scheduling Problems for Parallel Programs.- 4. Automatic Construction of Parallel Programs.- 4.1. Parallelization of Linear Programs.- 4.2. Parallelization of Acyclic Programs.- 4.3. Parallelization of Cyclic Programs.- 4.4. Parallelization of Expressions.- 4.5. Concluding Remarks on Parallelization.- References.- 2 Theory of Parallel Programming. II. Survey of Formal Models.- 1. Introduction.- 1.1. Notation.- 2. The Memory.- 3. The Operator and Database.- 3.1. Operator.- 3.2. Database.- 4. Computational Processes.- 4.1. Definition.- 4.2. Classes of Processes.- 5. The Metamodel.- 5.1. Metasystem.- 5.2. General Form.- 5.3. Special Classes.- 5.4. Schemata.- 6. The Control.- 6.1. Semantic Definition.- 6.2. Mixed Definition.- 6.3. Syntactic Definition.- 6.4. The Hyperoperator.- 7. Equivalence of Computational Processes.- 7.1. Functional Equivalence.- 7.2. Equivalence of All Results.- 7.3. Cell History Equivalence.- 7.4. Data Graph Equivalence.- 7.5. Colored Data Graph Equivalence.- 7.6. Data-Logical Graph Equivalence.- 7.7. Interrelationship of Equivalence Definitions.- 8. Determinacy of Metasystems.- 9. Equivalence of Metasystems.- 9.1. Functional Equivalence.- 9.2. Cell History Equivalence (h-Equivalence).- 9.3. Data Graph Equivalence (G-Equivalence).- 9.4. Survey of Equivalence Studies.- 10. Asynchronism.- 11. Programs and Systems.- 12. Conclusions.- References.- 3 Data Structure Models in Information System Design.- 1. Data Morphology.- 1.1. What Is Data Morphology?.- 1.2. Concepts and Properties of Name Space.- 1.3. Concepts and Properties of Value Space.- 1.4. The Data Space and Classification of Data Structures.- 1.5. Storage Structures and Mappings.- 1.6. Implementation of Mappings.- 2. Data Structure Models for Simple Information Retrieval.- 2.1. Thesaurus-Based System.- 2.2. Multiattribute Systems.- 2.3. Equivalence of Two Models.- 3. Data Structures for Information Systems of Flexible Use.- 3.1. Databases and Data Banks.- 3.2. Relational Models.- 3.3. Hereditary Models.- 4. Conclusions.- References.- 4 The Mathematical Theory of L Systems.- 0. Introduction.- 1. 1 Schemes and L Systems.- 2. Squeezing Languages out of L Systems.- 2.1. Exhaustive Approach.- 2.2. Selective Approaches.- 2.3. Comparing the Language Generating Power of Various Mechanisms for Defining Languages.- 3. Fitting Classes of L Languages into Known Formal Language Theoretic Framework.- 4. Other Characterizations of Classes of L Languages within the Framework of Formal Language Theory.- 4.1. Closure Properties.- 4.2. Machine Models.- 4.3. Recurrence Systems and Recursion Schemes.- 5. Structural Constraints on L Systems.- 6. Squeezing Sequences out of L Systems.- 7. Growth Functions.- 7.1. Definitions and Basic Problems.- 7.2. DOL Growth: Equivalence, Analysis, Synthesis.- 7.3. DIL Growth.- 7.4. Length Sets.- 8. Decision Problems.- 8.1. Some Decidability and Undecidability Results.- 8.2. DOL Equivalence Problem.- 9. Global Versus Local Behavior of L Systems.- 10. Deterministic Versus Nondeterministic Behavior of L Systems.- 11. L Transformations.- 12. Getting Down to Properties of Single L Languages or Sequences.- 13. Generalizing L System Ideas: Toward a Uniform Framework.- 14. Some Proof Techniques.- 15. Conclusions.- References.