Back to Results
First PageMeta Content
Concurrent computing / Computer architecture / Models of computation / Parallel computing / Software transactional memory / Thread / Linearizability / Concurrent data structure / Lock / Computing / Concurrency control / Transaction processing


Applying Dataflow and Transactions to Lee Routing Chris Seaton, Daniel Goodman, Mikel Luj´an, and Ian Watson University of Manchester {seatonc,goodmand,mikel.lujan,watson}@cs.man.ac.uk
Add to Reading List

Document Date: 2013-03-27 03:32:35

Open Document

File Size: 366,14 KB

Share Result on Facebook

City

Paris / /

/

Facility

Ian Watson University of Manchester / University of Manchester / MUTS library / University Transactions / /

IndustryTerm

blunt tool / good-enough solution / software transactional memory algorithms / software transactional memory / multicore shared-memory systems / actual routing applications / typical desktop hardware / proposed solution / shortest solution / multicore systems / /

OperatingSystem

Linux / /

Organization

University of Manchester / /

Person

Lee Routing Chris Seaton / Daniel Goodman / Mikel Luj´an / /

Position

collector / scheduler / /

ProgrammingLanguage

Java / Scala / /

Technology

Virtual Machine / software transactional memory algorithms / Lee algorithm / shared memory / Java / Linux / mobile devices / /

SocialTag