Back to Results
First PageMeta Content
Chunk / C dynamic memory allocation / Computing


BulkCompactor: Optimized Deterministic Execution via Conflict-Aware Commit of Atomic Blocks∗ Yuelu Duan, Xing Zhou, Wonsun Ahn, and Josep Torrellas University of Illinois at Urbana-Champaign http://iacoma.cs.uiuc.edu A
Add to Reading List

Document Date: 2012-01-17 23:07:07

Open Document

File Size: 323,59 KB

Share Result on Facebook

Company

LG / Intel / /

Currency

pence / USD / /

Event

FDA Phase / Reorganization / /

Facility

store Chunk / BC BC-S Conflict Degree BC Conflict Distance BC Chunks Store / WULS stall / Josep Torrellas University of Illinois / Chunks Store / /

IndustryTerm

decision algorithms / earlier processor / parallel applications / shared-memory systems / round-robin deterministic systems / cache line replacement algorithm / nearest-neighbor algorithms / less energy / performance comparable to nondeterministic systems / successor processors / conventional lazy-scheme protocol / less comparison hardware / deterministic systems / substantial hardware / energy / /

Organization

University of Illinois / National Science Foundation / Signature / Illinois-Intel Parallelism Center / /

Person

Xing Zhou / /

Position

leader / centralized arbiter / arbiter / /

Product

BulkCompactor / R0 / /

ProgrammingLanguage

R / /

ProvinceOrState

Illinois / /

Technology

decision algorithms / three processors / 16 processors / distributed algorithm / squashed processor / BulkSC protocol / nearest-neighbor algorithms / neighboring processors / earlier processor / conventional lazy-scheme protocol / 8 processors / two processors / requesting processor / last processor / squashing processor / actual distributed BulkCompactor algorithm / successor processors / 64 processors / leader processor / simulation / operating system / sequential consistency / 32 processors / cache line replacement algorithm / /

URL

http /

SocialTag