Sciweavers

11214 search results - page 117 / 2243
» Just-in-time data structures
Sort
View
ISCA
1993
IEEE
137views Hardware» more  ISCA 1993»
15 years 8 months ago
Transactional Memory: Architectural Support for Lock-Free Data Structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
Maurice Herlihy, J. Eliot B. Moss
FECS
2006
152views Education» more  FECS 2006»
15 years 5 months ago
Infusing Critical Thinking Skill Compare and Contrast into Content of Data Structures Course
This paper describes some of our efforts in infusing the critical thinking skill of comparing and contrasting into a course on data structures. Comparing and contrasting is the pr...
M. R. K. Krishna Rao, Muhammad Shafique, Kanaan A....
ITA
2007
153views Communications» more  ITA 2007»
15 years 3 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
149
Voted
MICRO
2010
IEEE
242views Hardware» more  MICRO 2010»
15 years 1 months ago
ASF: AMD64 Extension for Lock-Free Data Structures and Transactional Memory
Advanced Synchronization Facility (ASF) is an AMD64 hardware extension for lock-free data structures and transactional memory. It provides a speculative region that atomically exec...
Jae-Woong Chung, Luke Yen, Stephan Diestelhorst, M...
179
Voted
PPOPP
2011
ACM
14 years 6 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...