3584 search results - page 414 / 717 » Parallel Computing of Thermoelasticity Problems |
147
Voted
HCW
2000
IEEE
15 years 8 months ago
2000
IEEE
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
125
Voted
HPDC
1998
IEEE
15 years 8 months ago
1998
IEEE
One of the most difficult problems to be solved by metacomputing systems is to ensure strong authentication and authorization. The problem is complicated since the hosts involved ...
139
Voted
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
161
Voted
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
172
click to vote
SPAA
1994
ACM
15 years 8 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...