| dbo:abstract
|
- In computer science, a lock convoy is a performance problem that can occur when using locks for concurrency control in a multithreaded application. A lock convoy occurs when multiple threads of equal priority contend repeatedly for the same lock. Unlike deadlock and livelock situations, the threads in a lock convoy do progress; however, each time a thread attempts to acquire the lock and fails, it relinquishes the remainder of its scheduling quantum and forces a context switch. The overhead of repeated context switches and underutilization of scheduling quanta degrade overall performance. Lock convoys often occur when concurrency control primitives such as locks serialize access to a commonly used resource, such as a memory heap or a thread pool. They can sometimes be addressed by using non-locking alternatives such as lock-free algorithms or by altering the relative priorities of the contending threads. (en)
- En konvojeffekt är ett fenomen relaterat till First Come First Serve-algoritmen inom schemaläggning där ett operativsystem saktas ner på grund av långsamma processer. First Come First Serve-algoritmens grundprincip är att den schemalägger en process så fort den kommer in. En konvojeffekt uppstår när en långsam process schemaläggs varefter en eller flera korta processer kommer in och vill schemaläggas. De korta processerna måste i denna situation vänta på att den långsamma processen blir klar innan de kan exekvera vilket skapar fördröjning och lång medel-turnaround-tid. (sv)
|
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 1797 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| gold:hypernym
| |
| rdf:type
| |
| rdfs:comment
|
- En konvojeffekt är ett fenomen relaterat till First Come First Serve-algoritmen inom schemaläggning där ett operativsystem saktas ner på grund av långsamma processer. First Come First Serve-algoritmens grundprincip är att den schemalägger en process så fort den kommer in. En konvojeffekt uppstår när en långsam process schemaläggs varefter en eller flera korta processer kommer in och vill schemaläggas. De korta processerna måste i denna situation vänta på att den långsamma processen blir klar innan de kan exekvera vilket skapar fördröjning och lång medel-turnaround-tid. (sv)
- In computer science, a lock convoy is a performance problem that can occur when using locks for concurrency control in a multithreaded application. A lock convoy occurs when multiple threads of equal priority contend repeatedly for the same lock. Unlike deadlock and livelock situations, the threads in a lock convoy do progress; however, each time a thread attempts to acquire the lock and fails, it relinquishes the remainder of its scheduling quantum and forces a context switch. The overhead of repeated context switches and underutilization of scheduling quanta degrade overall performance. (en)
|
| rdfs:label
|
- Lock convoy (en)
- Konvojeffekt (sv)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageDisambiguates
of | |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
