Interleaved execution


Interleaved execution

Articleissues
article=y
orphan=October 2006
notability=December 2007
unreferenced=December 2007

Interleaved execution is where the database management system controls the execution of two or more transactions in parallel but where only one operation is occurring at any given time within the system.


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Interleaved memory — On nomme interleaving le système d adressage consistant à aller chercher le contenu des adresses paires dans un banc de mémoire et celui des adresses impaires dans un autre. Il est possible de presque doubler ainsi le débit apparent de la mémoire …   Wikipédia en Français

  • Write-Read conflict — In computer science, in the field of databases, Write Read Conflict, also known as reading uncommitted data, is a computational anomaly associated with interleaved execution of transactions.Given a schedule D:D = egin{bmatrix}T1 T2 R(A) W(A)… …   Wikipedia

  • Write–read conflict — In computer science, in the field of databases, Write Read Conflict, also known as reading uncommitted data, is a computational anomaly associated with interleaved execution of transactions. Given a schedule S T2 could read a database object A,… …   Wikipedia

  • multitasking — /mul tee tas king, tah sking, mul tuy /, n. Computers. the concurrent or interleaved execution of two or more jobs by a single CPU. Also, multi tasking. [MULTI + TASKING] * * * Mode of computer operation in which the computer works on multiple… …   Universalium

  • Write-Write conflict — In computer science, in the field of databases, Write Write Conflict, also known as overwriting uncommitted data is a computational anomaly associated with interleaved execution of transactions.Given a schedule HH = egin{bmatrix}T1 T2 W(A) W(B)… …   Wikipedia

  • Read-Write conflict — In computer science, in the field of databases, Read Write Conflict, also known as unrepeatable reads, is a computational anomaly associated with interleaved execution of transactions. Given a schedule D:D = egin{bmatrix}T1 T2 R(A) R(A) W(A) Com …   Wikipedia

  • multiprogramming — /mul tee proh gram ing, greuh ming, mul tuy /, n. Computers. the overlapped or interleaved execution of two or more programs by a single CPU. [1955 60; MULTI + PROGRAM + ING1] * * * …   Universalium

  • Write–write conflict — In computer science, in the field of databases, Write Write Conflict, also known as overwriting uncommitted data is a computational anomaly associated with interleaved execution of transactions. Given a schedule S note that there is no read in… …   Wikipedia

  • Multithreading (computer architecture) — This article describes hardware supports for multithreads. For thread in software, see Thread (computer science). Multithreading computers have hardware support to efficiently execute multiple threads. These are distinguished from multiprocessing …   Wikipedia

  • Multithreading (computer hardware) — Multithreading computers have hardware support to efficiently execute multiple threads. These are distinguished from multiprocessing systems (such as multi core systems) in that the threads must all operate in the same address space, as there is… …   Wikipedia