Preview

Concurrency

Good Essays
Open Document
Open Document
515 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Concurrency
CONCURRENCY
Prepared by : Wigdan Nadeem

1

Introduction  Theory of concurrency  Models  Key terms related to concurrency  Concurrency areas  Concurrency control  Advantages and Disadvantages  References


2

Concurrency is the ability of a database to allow multiple users to affect multiple transactions. This is one of the main properties that separate a database from other forms of data storage like spreadsheets.

3

Concurrency theory has been an active field of research in theoretical computer science. One of the first proposals was Carl Adam Petri's seminal work on Petri Nets in the early 1960s. In the years since, a wide variety of formalisms have been developed for modeling and reasoning about concurrency.

4

A number of formalisms for modeling and understanding concurrent systems have been developed, including but not limited to: - The Parallel Random Access Machine. - The Actor model - Computational bridging models such as the BSP model.

5

6

- Operating systems: The most common topic where concurrency is taught and addressed is in the context of operating systems design and implementation. - Scientific and high-performance computing: For many decades, the HPC and scientific computing areas were the primary source of work on parallelism. - Databases and servers: Server-side applications that needed to handle multiple concurrent users.

7

Any application that is run on a laptop or desktop system with multiple cores can use concurrency for performance gains. - Games - Desktop applications - Development tools - Image and data processing

8

To ensures that correct results for concurrent operations are generated, while getting those results as quickly as possible. Simultaneous execution of transactions over a shared database can create several data integrity and consistency problems: - Lost Updates. - Uncommitted Data. - Inconsistent retrievals.

9

- Pessimistic concurrency control: assumes that

You May Also Find These Documents Helpful

  • Good Essays

    Among them the first approach was proposed in 1984 by Chandy and Lamport, to build a possible global state of a distributed system [20]. The goal ofthis protocol is to build a consistent distributed snapshot of the distributed system. A distributed snapshot is a collection of process checkpoints (one per process), and a collection of in-flight messages (an ordered list of messages for each point to point channel). The protocol assumes ordered loss-less communication channel; for a given application, messages can be sent or received after or before a process took its checkpoint. A message from process p to process q that is sent by the application after the checkpoint of process p but received before process q checkpointed is said to be an orphan message. Orphan messages must be avoided by the protocol, because they are going to be re-generated by the application, if it were to restart in that snapshot. Similarly, a message from process p to process q that is sent by the application before the checkpoint of process p but received after the checkpoint of process q is said to be missing. That message must belong to the list of messages in channel p to q, or the snapshot is inconsistent. A snapshot that includes no orphan message, and for which all the saved channel messages are missing messages is consistent, since the application can be started from that state and pursue its computation…

    • 1211 Words
    • 5 Pages
    Good Essays
  • Good Essays

    Nt1310 Unit 3 Os

    • 1341 Words
    • 6 Pages

    +• Synchronization: With multiple active processes having potential access to shared address spaces or shared I/O resources, care must be taken to provide effective synchronization. Synchronization is a facility that enforces mutual exclusion and event…

    • 1341 Words
    • 6 Pages
    Good Essays
  • Best Essays

    Ellis, R. (n.d.). Lock Granularity. Granularity of Locks_and Degrees of Consistency_in a Shared Database. Retrieved September 12, 2013, from www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=9&sqi=2&ved=0CF8QFjAI&url=http%3A%2F%2Fpages.cs.wisc.edu%2F~nil%2F764%2FTrans%2FGranularity.ppt&ei=kQ8yUqOhPIzl4AOM6oDIDw&usg=AFQjCNEdfijo3XG83N7W2WlglSi3cEJsQQ&sig2=WGLffPJ8amqYRjHXJAHLuQ&bvm=bv.52109…

    • 1383 Words
    • 5 Pages
    Best Essays
  • Good Essays

    * Whether there will be simultaneous users and how many simultaneous users would the database be able to handle.…

    • 889 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    Database and Page Ref

    • 4307 Words
    • 19 Pages

    9) Concurrency control measures are taken to ensure that one user's work has absolutely no influence on another user's work.…

    • 4307 Words
    • 19 Pages
    Powerful Essays
  • Good Essays

    Riordan Sr-Rm-013

    • 722 Words
    • 3 Pages

    Sommer, R. (2009, July). An architecture for exploiting multi-core processors to parallelize network intrusion prevention..Concurrency & Computation: Practice & Experience, 21(10)…

    • 722 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Question 1

    • 1978 Words
    • 24 Pages

    Most transactional databases are not set up to be simultaneously accessed for reporting and analysis. As a consequence:…

    • 1978 Words
    • 24 Pages
    Powerful Essays
  • Good Essays

    In the fields of computer science and information technology there are often transactions, operations or jobs that are executed to gather a result. In most cases these results come in bunches and many separate transactions may have to occur at the same time. The process of managing simultaneous execution of transactions while ensuring the serializability of transactions in a database is known as concurrency control.…

    • 597 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    The Apostolate

    • 8252 Words
    • 34 Pages

    [OV91] M. T. O ̈ zsu and P. Valduriez. Principles of Distributed Database Systems. Prentice-Hall, New Jersey, 1991.…

    • 8252 Words
    • 34 Pages
    Powerful Essays
  • Good Essays

    Mutual Exclusion not required for sharable resources; for non-sharable resources generally not possible to prevent deadlocks by denying the mutual-exclusion condition a possible solution – a spooler Hold and Wait Require process to request and be allocated all its resources before it begins execution, or allow process to request resources only when the process has none No Preemption If a process that is holding some resources requests another resource that cannot be immediately allocated to it, then all resources currently being held are released Circular Wait impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration…

    • 1184 Words
    • 5 Pages
    Good Essays
  • Good Essays

    . Description: Modern operating systems, by permitting more than one data processing task to be performed concurrently, make possible more efficient use of system resources. If a program that is being executed to accomplish a task must be delayed, for example, until more data is read into the computer, performance of some other completely independent task can proceed. The central processing unit can execute another program or even execute the same program to accomplish a different task. In the competition for system resources, such as main storage space or data sets (files), however, all multitasking systems are subject to a condition referred to as deadlock. This condition prevents the affected tasks from being carried out to completion. Several conditions must exist for tasks to become deadlocked. Consider a simple example involving only two tasks that are being performed concurrently. Assume that each task has been allocated a system resource which has been used in partially completing the task. Assume also that allocated resources are released only after completion of the task. If completing each task requires an additional resource and if the additional resource has been allocated to the other task, neither task can be completed; that is, task deadlock exists. Such impasses can arise in many forms involving many tasks, and when task deadlock does occur, there is no known general technique for correcting the condition. Problem: Case histories Acquiring for each job step, in turn, the resources required to This module actually issues the ATTACH macroinstruction, As shown in Figure 3. as the jobs were executed. Requests are fraught with deadlock…

    • 265 Words
    • 2 Pages
    Good Essays
  • Good Essays

    A graph that deals with data divided into segments and operates on each segment simultaneously uses component parallelism…

    • 2771 Words
    • 12 Pages
    Good Essays
  • Powerful Essays

    In a lockstep execution, a particular vehicle mode should correspond to other vehicle modes or certain states of specific system functions or components. In a synchronous execution, vehicle modes and function/component states are synchronized frequently with each other. In an asynchronous execution, vehicle modes and function/component states work independently and have no demands on state agreement among each other. One effective architectural solution for regulating accesses to shared actuation and computation resources is to introduce arbitration servers. For example, Server- Based Scheduling [8] is a kind of share-driven scheduling scheme that allows the isolation of temporal aspect of applications and thereby promotes dynamic reconfiguration in regards to the management of shared resources (e.g., task and network…

    • 6716 Words
    • 27 Pages
    Powerful Essays
  • Better Essays

    When dealing with locks two problems can arise, the first of which being deadlock. Deadlock refers to a particular situation where two or more processes are each waiting for another to release a resource, or more than two processes are waiting for resources in a circular chain. Deadlock is a common problem in multiprocessing where many processes share a specific type of mutually exclusive resource. Some computers, usually those intended for the time-sharing and/or real-time markets, are often equipped with a hardware lock, or hard lock, which guarantees exclusive access to processes, forcing serialization. Deadlocks are particularly disconcerting because there is no general solution to avoid them.…

    • 2731 Words
    • 9 Pages
    Better Essays
  • Better Essays

    Mutex

    • 1644 Words
    • 7 Pages

    References: [1] L. Lamport. A new solution of Dijkstra 's concurrent programming problem. Communications of the ACM, 17(8) pp. 453-455, August 1974…

    • 1644 Words
    • 7 Pages
    Better Essays