Back to Results
First PageMeta Content
Computer memory / Concurrency control / Concurrency / Compiler construction / Transaction processing / Java Memory Model / Memory barrier / Memory ordering / Lock / Computing / Computer architecture / Software engineering


Mathematizing C++ Concurrency Mark Batty Scott Owens Susmit Sarkar
Add to Reading List

Document Date: 2010-12-10 02:43:43

Open Document

File Size: 285,82 KB

Share Result on Facebook

City

Austin / /

Company

Introduction Context Systems / Chs / /

Country

United States / /

Currency

USD / /

Facility

Store Buffering / Concurrency Mark Batty Scott Owens Susmit Sarkar Peter Sewell Tjark Weber University / /

IndustryTerm

x86 hardware / stronger processor / minimal mathematical machinery / computational infrastructure / typical hardware / highperformance concurrent algorithms / abstraction above widely varying underlying hardware / /

Organization

Mathematizing C++ Concurrency Mark Batty Scott Owens Susmit Sarkar Peter Sewell Tjark Weber University of Cambridge Abstract Shared-memory / United Nations / Final Committee / C++ Standards Committee / Concurrency subcommittee / /

Person

Given / Xwitness / Stream Architectures (Multiprocessors) / Message Passing / /

Position

hb / model / memory model / displaying them graphically / MP / relatively complex axiomatic memory model / vsse head / General / rs head / programmer / candidate / /

Product

C PPMEM tool / C+ / C PPMEM / /

ProgrammingLanguage

Java / C / C++ / /

ProvinceOrState

Texas / /

RadioStation

WREL / /

Technology

Java / stronger processor / operating system / highperformance concurrent algorithms / Sequential consistency / shared memory / GC algorithms / cmp / cad / /

SocialTag