631 search results - page 88 / 127 » Composable memory transactions |
CASCON
1997
14 years 11 months ago
1997
This paper describes the implementation of a reliable Get-Put interface written for a distributed memory environment. The asynchronous semantics of the Put as well as the split tr...
ARC
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. In this paper, we take a MIPS-based open-source uniprocessor soft core, Plasma, and extend it to obtain the Beefarm infrastructure for FPGA-based multiprocessor emulation...
HPCA
2006
IEEE
15 years 10 months ago
2006
IEEE
Building processors with large instruction windows has been proposed as a mechanism for overcoming the memory wall, but finding a feasible and implementable design has been an elu...
146
click to vote
POPL
2002
ACM
15 years 10 months ago
2002
ACM
Data-layout optimizations rearrange fields within objects, objects within objects, and objects within the heap, with the goal of increasing spatial locality. While the importance ...
SEFM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...