17541 search results - page 5 / 3509 » Complexity in scalable computing |
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
ICCS
2005
Springer
14 years 18 days ago
2005
Springer
In the next five years, the number of processors in high-end systems for scientific computing is expected to rise to tens and even hundreds of thousands. For example, the IBM Blu...
RTSS
2007
IEEE
14 years 1 months ago
2007
IEEE
Creating robust real-time embedded software is critical in combining the physical world with computing, such as in consumer electronics or robotics. One challenge is the complexit...
SIMUTOOLS
2008
13 years 8 months ago
2008
This paper presents an OMNeT-based Framework to simulate large complex storage networks, with its corresponding underlying subsystems (I/O, Networking, etc.). With this Framework,...
TC
2010
13 years 5 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...