2926 search results - page 575 / 586 » Partially Optimal Routing |
PLDI
1999
ACM
13 years 11 months ago
1999
ACM
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
HPDC
1999
IEEE
13 years 11 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
This paper presents an efficient approach to perform global interconnect sizing and spacing (GISS) for multiple nets to minimize interconnect delays with consideration of couplin...
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
VLDB
1992
ACM
13 years 11 months ago
1992
ACM
This paper evaluates the performance of the parallel, main-memory DBMS, PRISMA/DB. First, an architecture for parallel query execution is presented. A performance model for the ex...