874 search results - page 37 / 175 » Predicting the Running Times of Parallel Programs by Simulat... |
76
Voted
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
We study the issue of performance prediction on the SGIPower Challenge, a typical SMP. On such a platform, the cost of memory accesses depends on their locality and on contention ...
ISORC
2003
IEEE
15 years 3 months ago
2003
IEEE
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...
115
click to vote
CG
2008
Springer
14 years 9 months ago
2008
Springer
As multi-core processor systems become more and more widespread, the demand for efficient parallel algorithms also propagates into the field of computer graphics. This is especial...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
IJFCS
2008
14 years 9 months ago
2008
We propose two different ways to simulate Boolean circuits in the framework of ciliate computations, based on the intramolecular and on the intermolecular gene assembly models wit...