Back to Results
First PageMeta Content
Concurrency / Computer programming / Transaction processing / Thread / Non-blocking algorithm / Stack / Concurrent data structure / Lock / Linearizability / Concurrency control / Computing / Concurrent computing


OOPSLA Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL), San Diego, CA, October 2005 A Scalable Elimination-based Exchange Channel William N. Scherer III
Add to Reading List

Document Date: 2011-04-01 10:29:59


Open Document

File Size: 146,43 KB

Share Result on Facebook

City

Barcelona / Providence / Amsterdam / Santa Barbara / San Diego / Trier / /

Company

Sun Microsystems Laboratories / Chicago Journal / Las Vegas NV / /

Country

Germany / Netherlands / Spain / /

/

Facility

Computer Science University of Rochester Rochester / Node mine / /

IndustryTerm

server software / exchanger algorithm / approximate solution / genetic algorithms / parallel genetic algorithms / potential multi-party swap applications / overhead solution / /

Organization

National Science Foundation / Computer Science University of Rochester Rochester / Exchange Consider / SUNY / /

Person

Michael L. Scott / M. Herlihy / V / Christopher Brown / William N. Scherer III / Doug Lea / /

/

Position

waiter / Parallel Programming General / Parallel GA-Traveling Salesman / Private / salesman / producer / candidate for such experimentation / final Thread waiter / /

ProgrammingLanguage

Promela / Java / /

ProvinceOrState

Rhode Island / California / New York / /

PublishedMedium

Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

exchanger algorithm / Java / Lock-Free Stack Algorithm / http / lock-freedom / parallel genetic algorithms / recombination / operating systems / Terms algorithms / /

SocialTag