Sciweavers

437 search results - page 27 / 88
» Reducing Memory Sharing Overheads in Distributed JVMs
Sort
View
EUROPAR
2010
Springer
13 years 8 months ago
Profile-Driven Selective Program Loading
Abstract. Complex software systems use many shared libraries frequently composed of large off-the-shelf components. Only a limited number of functions are used from these shared li...
Tugrul Ince, Jeffrey K. Hollingsworth
HPDC
2007
IEEE
14 years 1 months ago
Feedback-directed thread scheduling with memory considerations
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
Fengguang Song, Shirley Moore, Jack Dongarra
EUROPDS
1997
13 years 9 months ago
A Combined Virtual Shared Memory and Network which Schedules
In this paper, we follow a new path to arrive at the idea of a COMA — a Cache Only Memory Architecture. We show how the evolution of another architecture (ADARC) leads quite nat...
Ronald Moore, Bernd Klauer, Klaus Waldschmidt
ISSS
1996
IEEE
134views Hardware» more  ISSS 1996»
13 years 11 months ago
ADOPT: Efficient Hardware Address Generation in Distributed Memory Architectures
An address generation and optimization environment (ADOPT) for distributed memory architectures, is presented. ADOPT is oriented to minimize the area overhead introduced by the us...
Miguel Miranda, Francky Catthoor, Martin Janssen, ...
HOTI
2005
IEEE
14 years 1 months ago
Long Round-Trip Time Support with Shared-Memory Crosspoint Buffered Packet Switch
— The amount of memory in buffered crossbars in combined input-crosspoint buffered switches is proportional to the number of crosspoints, or O(N2 ), where N is the number of port...
Ziqian Dong, Roberto Rojas-Cessa