Back to Results
First PageMeta Content
Concurrent computing / Edsger W. Dijkstra / Parallel computing / Computing / Computer programming / Concurrent programming languages / TARDIS / Parallel Extensions / Data / Synchronization / Lock / Task


TARDIS: Task-level Access Race Detection by Intersecting Sets ∗ Li Lu Weixing Ji University of Rochester
Add to Reading List

Document Date: 2013-03-04 17:36:14

Open Document

File Size: 449,45 KB

Share Result on Facebook

City

Denver / Orlando / Dublin / Seattle / Tucson / Dresden / Brighton / Austin / New York / Newport / Shenzhen / Albuquerque / Rome / Portland / Phoenix / Beijing / Toronto / Bonn / Puerto Vallarta / San Diego / San Jose / /

Company

IEEE/ACM Intl / 9th IEEE/ACM Intl / /

Country

Germany / Italy / Mexico / Canada / United Kingdom / China / Ireland / /

/

Facility

Beijing Institute / University of Rochester / Li Lu Weixing Ji University of Rochester / /

MarketIndex

PARSEC / /

OperatingSystem

Linux / /

Organization

Chinese Scholarship Council / National Science Foundation / Gelato Federation / University of Rochester / Beijing Institute of Technology / /

Person

J. Zhao / V / Michael L. Scott / Ruby List / Michael Scott / S. T. Heumann / V / R. L. Bocchino Jr. / V / Li Lu / /

Position

work-stealing scheduler / effects model for safe concurrency / general / fork-join programs / programmer / /

ProgrammingLanguage

FL / Cilk / JRuby / Java / /

ProvinceOrState

Texas / New York / Washington / New Mexico / Rhode Island / Florida / California / Arizona / Colorado / /

PublishedMedium

Journal of the ACM / /

Technology

Object-Oriented Programming / virtual machine / parent task Algorithm / Linux / 2 processors / Operating Systems / 3.2 Race Detection Algorithm / Java / /

URL

http /

SocialTag