Scalable Synchronous Queues.
In a thread-safe concurrent queue, consumers typically wait for producers to make data available. In a synchronous queue, producers similarly wait for consumers to take the data. We present two new nonblocking, contention-free synchronous queues that achieve high performance through a form of dualis...
| Publicado en: | Communications of the ACM Vol. 52; no. 5; pp. 100 - 109 |
|---|---|
| Autores principales: | , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
May2009
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=39363014&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 39363014 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: May2009 vid: 52 iid: 5 pid: 68 pub: Association for Computing Machinery artinfo: ui: 39363014 10.1145/1506409.1506431 ppf: 100 ppct: 9 formats: tig: atl: Scalable Synchronous Queues. aug: au: Scherer, III, William N. Lea, Doug Scott, Michael L. affil: Department of Computer Science, Rice University, Houston, TX. Department of Computer Science, SUNY Oswego, Oswego, NY. Department of Computer Science, University of Rochester, Rochester, NY. su: Threads (Computer programs) Data structures Computer software Computer multitasking Electronic data processing Algorithms sug: subj: Threads (Computer programs) Data structures Computer software Computer multitasking Electronic data processing Algorithms ab: In a thread-safe concurrent queue, consumers typically wait for producers to make data available. In a synchronous queue, producers similarly wait for consumers to take the data. We present two new nonblocking, contention-free synchronous queues that achieve high performance through a form of dualism: The underlying data structure may hold both data and, symmetrically, requests. We present performance results on 16-processor SPARC and 4-processor Opteron machines. We compare our algorithms to commonly used alternatives from the literature and from the Java SE 5.0 class java.util.concurrent .SynchronousQueue both directly in synthetic microbenchmarks and indirectly as the core of Java's ThreadPoolExecutor mechanism. Our new algorithms consistently outperform the Java SE 5.0 SynchronousQueue by factors of three in unfair mode and 14 in fair mode; this translates to factors of two and ten for the ThreadPoolExecutor. Our synchronous queues have been adopted for inclusion in Java 6. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2009 holdings: @attributes: islocal: N |
|---|