874 search results - page 89 / 175 » Predicting the Running Times of Parallel Programs by Simulat... |
ISPASS
2006
IEEE
15 years 3 months ago
2006
IEEE
Detailed microarchitectural simulators are not well suited for exploring large design spaces due to their excessive simulation times. We introduce AXCIS, a framework for fast and ...
ALGORITHMICA
2005
14 years 9 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
78
Voted
GRID
2006
Springer
14 years 9 months ago
2006
Springer
In this paper, a task parallel application is implemented with Ninf-G which is a GridRPC system, and experimented on, using the Grid testbed in Asia Pacific, for three months. The...
ASAP
2007
IEEE
15 years 1 months ago
2007
IEEE
Monte-Carlo simulations are used in many applications, such as option pricing and portfolio evaluation. Due to their high computational load and intrinsic parallelism, they are id...
MST
1998
14 years 9 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...