1555 search results - page 112 / 311 » A data intensive distributed computing architecture for |
119
Voted
HPDC
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper explores the feasibility of a cost-efficient storage architecture that offers the reliability and access performance characteristics of a high-end system. This architec...
110
click to vote
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper describes the design and implementation on MIMD parallel machines of P-AutoClass, a parallel version of the AutoClass system based upon the Bayesian method for determini...
130
click to vote
HOTI
2005
IEEE
15 years 7 months ago
2005
IEEE
: The exposed memory hierarchies employed in many network processors (NPs) are expensive in terms of meeting the worst-case processing requirement. Moreover, it is difficult to ef...
113
click to vote
SBACPAD
2005
IEEE
15 years 7 months ago
2005
IEEE
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
127
click to vote
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...