Sciweavers

2019 search results - page 237 / 404
» Programming with Shared Data Abstractions
Sort
View
ICPP
1999
IEEE
15 years 7 months ago
Improving Performance of Load-Store Sequences for Transaction Processing Workloads on Multiprocessors
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
Jim Nilsson, Fredrik Dahlgren
PARCO
2003
15 years 4 months ago
Cache Memory Behavior of Advanced PDE Solvers
Three different partial differential equation (PDE) solver kernels are analyzed in respect to cache memory performance on a simulated shared memory computer. The kernels implement...
Dan Wallin, Henrik Johansson, Sverker Holmgren
AFP
2004
Springer
128views Formal Methods» more  AFP 2004»
15 years 8 months ago
GEC: A Toolkit for Generic Rapid Prototyping of Type Safe Interactive Applications
Abstract. Programming GUIs with conventional GUI APIs is notoriously tedious. In these notes we present the GEC toolkit in which the programmer can create user interfaces without a...
Peter Achten, Marko C. J. D. van Eekelen, Rinus Pl...
BIRTHDAY
2009
Springer
15 years 7 months ago
Pervasive Theory of Memory
For many aspects of memory theoretical treatment already exists, in particular for: simple cache construction, store buers and store buer forwarding, cache coherence protocols, o...
Ulan Degenbaev, Wolfgang J. Paul, Norbert Schirmer
CATS
2008
15 years 4 months ago
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...
Lindsay Groves