Concurrency computing information management
Download as PPSX, PDF1 like145 views
Concurrency computing allows multiple tasks to be executed simultaneously using single or multiple processors. It reduces overall time to perform tasks compared to sequential execution. There are different types of concurrent computing like multiprogramming, multiprocessing, multitasking, and distributed systems. Multiprogramming shares a single CPU among users through time-sharing or priority algorithms. Multiprocessing uses multiple CPUs to execute tasks simultaneously with shared memory. Multitasking allows a single user to run multiple tasks concurrently using one or more CPUs. Distributed systems involve multiple computers working together without a central controller.
Concurrency computing information management
- 1. CONCURRENCY COMPUTING Presented by V. VINITHA M. PRADEEPA J. JOHN BRITTO E.GOWTHAMAN
- 2. CONCURRENCY: – Multiple tasks can be executed at the same time. – The overall time to perform the series of tasks is reduced.
- 3. Concurrency computing ■ Concurrent computing is a form of computing in which several computations are executed during overlapping time periods—concurrently—instead of sequentially (one completing before the next starts). ■ The process of utilizing computer technology to complete a task. computing may involve computer hardware and/or software. ■ Concurrent system is one where a computation can advance without waiting for all other computations to complete.
- 4. Types of concurrent computing: ■ Multiprogramming ■ Multiprocessing ■ Multitasking ■ Distributed Systems
- 5. Multiprogramming ■ Share a single CPU among many users or tasks. ■ May have a time-shared algorithm or a priority algorithm for determining which task to run next ■ Give the illusion of simultaneous processing through rapid swapping of tasks (interleaving).
- 6. Multiprocessing ■ Executes multiple tasks at the same time. ■ Uses multiple processors to accomplish the tasks. ■ Each processor may also timeshare among several tasks. ■ Has a shared memory that is used by all the tasks.
- 7. Multiprocessing Memory User 1: Task1 User 1: Task2 User 2: Task1 CPU User1 User2 CPU CPU
- 8. Multitasking ■ A single user can have multiple tasks running at the same time. ■ Can be done with one or more processors. ■ Used to be rare and for only expensive multiprocessing systems, but now most modern operating systems can do it.
- 9. Memory User 1: Task1 User 1: Task2 User 1: Task3 CPU User1 Multi –tasking:
- 10. Distributed Systems: Central Bank ATM Buford ATM Perimeter ATM Student Ctr ATM North Ave Multiple computers working together with no central program “in charge.”
- 11. Distributed Systems ■ Advantages: – No bottlenecks from sharing processors – No central point of failure – Processing can be localized for efficiency ■ Disadvantages: – Complexity – Communication overhead – Distributed control
- 12. CPU task 1 task 2 task 3 ZZZZ ZZZZ Concurrency can also be achieved on a computer with only one processor: The computer “juggles” jobs, swapping its attention to each in turn “Time slicing” allows many users to get CPU resources Tasks may be suspended while they wait for something, such as device I/O Many computers today have more than one processor (multiprocessor machines) Achieving Concurrency:
- 13. Advantage of concurrency computing Concurrent processes can reduce duplication in code. The overall runtime of the algorithm can be significantly reduced. More real-world problems can be solved than with sequential algorithms alone. sequentially can make systems more reliable.
- 14. Disadvantage of concurrency computing: ■ Runtime is not always reduced, so careful planning is required ■ Concurrent algorithms can be more complex than sequential algorithms ■ Shared data can be corrupted ■ Communications between tasks is needed
- 15. Thank you