Intelligentedu
Beste Nieuwe Vrije IT die van de Computer de Middelen Van een privé-leraar opleidt
Translate to EnglishÜbersetzen Sie zum Deutsch/GermanΜεταφράστε στα ελληνικά/GreekПереведите к русскому/RussianOversetter til Norsk/NorwegianÖversätta till Svensk/Swedishहिनà¥à¤¦à¥€ अनà¥à¤µà¤¾à¤¦ करने के लिà¤/Hindi
Tradueix al català/CatalanTulkot uz latviešu/LatvianPreložiť do slovenčiny/SlovakVertaal aan het Nederlands/Dutchترجمة الى العربية/ArabicTraduzca al Español/SpanishTraduisez au Français/French
Traduca ad Italiano/ItalianTraduza ao Português/Portuguese日本語に翻訳しなさい /Japanese한국어에게 번역하십시오/Korean中文翻译/Chinese Simplified中文翻译/Chinese TraditionalПереклад на українську/Ukrainian





Het Broodje van Blog:

Section 4.7. Improving the Speed of Some Communication Operations
Section 4.8. Summary
Section 4.9. Bibliographic Remarks
Problems
Chapter 5. Analytical Modeling of Parallel Programs
Section 5.1. Sources of Overhead in Parallel Programs
Section 5.2. Performance Metrics for Parallel Systems
Section 5.3. The Effect of Granularity on Performance
Section 5.4. Scalability of Parallel Systems
Section 5.5. Minimum Execution Time and Minimum Cost-Optimal Execution Time
Section 5.6. Asymptotic Analysis of Parallel Programs
Section 5.7. Other Scalability Metrics
Section 5.8. Bibliographic Remarks
Problems
Chapter 6. Programming Using the Message-Passing Paradigm
Section 6.1. Principles of Message-Passing Programming
Section 6.2. The Building Blocks: Send and Receive Operations
Section 6.3. MPI: the Message Passing Interface
Section 6.4. Topologies and Embedding
Section 6.5. Overlapping Communication with Computation
Section 6.6. Collective Communication and Computation Operations
Section 6.7. Groups and Communicators
Section 6.8. Bibliographic Remarks
Problems
Chapter 7. Programming Shared Address Space Platforms
Section 7.1. Thread Basics
Section 7.2. Why Threads?
Section 7.3. The POSIX Thread API
Section 7.4. Thread Basics: Creation and Termination
Section 7.5. Synchronization Primitives in Pthreads
Section 7.6. Controlling Thread and Synchronization Attributes
Section 7.7. Thread Cancellation
Section 7.8. Composite Synchronization Constructs
Section 7.9. Tips for Designing Asynchronous Programs
Section 7.10. OpenMP: a Standard for Directive Based Parallel Programming
Section 7.11. Bibliographic Remarks
Problems
Chapter 8. Dense Matrix Algorithms
Section 8.1. Matrix-Vector Multiplication
Section 8.2. Matrix-Matrix Multiplication
Section 8.3. Solving a System of Linear Equations
Section 8.4. Bibliographic Remarks
Problems
Chapter 9. Sorting
Section 9.1. Issues in Sorting on Parallel Computers
Section 9.2. Sorting Networks
Section 9.3. Bubble Sort and its Variants
Section 9.4. Quicksort
Section 9.5. Bucket and Sample Sort
Section 9.6. Other Sorting Algorithms
Section 9.7. Bibliographic Remarks
Problems
Chapter 10. Graph Algorithms
Section 10.1. Definitions and Representation
Section 10.2. Minimum Spanning Tree: Prim's Algorithm
Section 10.3. Single-Source Shortest Paths: Dijkstra's Algorithm
Section 10.4. All-Pairs Shortest Paths
Section 10.5. Transitive Closure
Section 10.6. Connected Components
Section 10.7. Algorithms for Sparse Graphs
Section 10.8. Bibliographic Remarks
Problems
Chapter 11. Search Algorithms for Discrete Optimization Problems
Section 11.1. Definitions and Examples
Section 11.2. Sequential Search Algorithms
Section 11.3. Search Overhead Factor
Section 11.4. Parallel Depth-First Search
Section 11.5. Parallel Best-First Search
Section 11.6. Speedup Anomalies in Parallel Search Algorithms
Section 11.7. Bibliographic Remarks
Problems
Chapter 12. Dynamic Programming
Section 12.1. Overview of Dynamic Programming
Section 12.2. Serial Monadic DP Formulations
Section 12.3. Nonserial Monadic DP Formulations
Section 12.4. Serial Polyadic DP Formulations
Section 12.5. Nonserial Polyadic DP Formulations
Section 12.6. Summary and Discussion
Section 12.7. Bibliographic Remarks
Problems
Chapter 13. Fast Fourier Transform
Section 13.1. The Serial Algorithm
Section 13.2. The Binary-Exchange Algorithm
Section 13.3. The Transpose Algorithm
Section 13.4. Bibliographic Remarks
Problems
Appendix A. Complexity of Functions and Order Analysis
Section A.1. Complexity of Functions
Section A.2. Order Analysis of Functions
Bibliography

Popularity: 11% [?]

Share and Enjoy:
  • blogmarks
  • del.icio.us
  • Furl
  • Reddit
  • Shadows
  • YahooMyWeb
  • StumbleUpon
  • Digg



Related Posts:
  • Free Book: Engineering a Linux Beowulf-style Compute Cluster
  • 166 Computer Science Books at FreeScience
  • Free Programming Methodology Course
  • Java Programming Lessons and Exercises
  • 20 Free Computer and Programming Books


    • Filed under: Best New Free Computer IT Training Tutorial Resources — computer_teacher @ 1:01 am
    Comments (0)


    No Comments »

    No comments yet.

    RSS feed for comments on this post.

    Leave a comment

    You must be logged in to post a comment.



    Powered by WordPress