Sciweavers

437 search results - page 24 / 88
» Reducing Memory Sharing Overheads in Distributed JVMs
Sort
View
IPPS
1999
IEEE
13 years 12 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
ICML
2002
IEEE
14 years 8 months ago
Learning to Share Distributed Probabilistic Beliefs
In this paper, we present a general machine learning approach to the problem of deciding when to share probabilistic beliefs between agents for distributed monitoring. Our approac...
Christopher Leckie, Kotagiri Ramamohanarao
ACSC
2003
IEEE
14 years 25 days ago
Policies for Sharing Distributed Probabilistic Beliefs
In this paper, we present several general policies for deciding when to share probabilistic beliefs between agents for distributed monitoring. In order to evaluate these policies,...
Christopher Leckie, Kotagiri Ramamohanarao
HPCA
2005
IEEE
14 years 8 months ago
SENSS: Security Enhancement to Symmetric Shared Memory Multiprocessors
With the increasing concern of the security on high performance multiprocessor enterprise servers, more and more effort is being invested into defending against various kinds of a...
Youtao Zhang, Lan Gao, Jun Yang 0002, Xiangyu Zhan...
SPAA
2003
ACM
14 years 24 days ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin