75 search results - page 12 / 15 » Iterated Runge-Kutta methods on distributed memory multiproc... |
PE
2008
Springer
13 years 7 months ago
2008
Springer
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...
OPODIS
2010
13 years 5 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse line...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
EUROPAR
1999
Springer
13 years 12 months ago
1999
Springer
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Du...