2432 search results - page 61 / 487 » Using simple abstraction to reinvent computing for paralleli... |
87
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Abstract. The inherently sequential nature of random discrete eventdriven simulation has made parallel and distributed processing di cult. This paper presents a method of applying ...
ICS
2003
Tsinghua U.
15 years 2 months ago
2003
Tsinghua U.
—The ever-increasing computational power of contemporary microprocessors reduces the execution time spent on arithmetic computations (i.e., the computations not involving slow me...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. Nested data-parallel programs often have large memory requirements due to their high degree of parallelism. Piecewise execution is an implementation technique used to min...
67
Voted
EUROPAR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Embedded Runge-Kutta methods are among the most popular methods for the solution of non-stiff initial value problems of ordinary differential equations (ODEs). We investi...
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper presents Salsa, a novel, decentralized and asynchronous realization of the “replica exchange” algorithm for simulating the structure, function, folding, and dyna...