Sciweavers

6004 search results - page 189 / 1201
» Parallelizing query optimization
Sort
View
FSTTCS
2006
Springer
14 years 2 months ago
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
Florent Becker, Ivan Rapaport, Eric Rémila
IPPS
1999
IEEE
14 years 2 months ago
NWCache: Optimizing Disk Accesses via an Optical Network/Write Cache Hybrid
In this paper we propose a simple extension to the I/O architecture of scalable multiprocessors that optimizes page swap-outs significantly. More specifically, we propose the use o...
Enrique V. Carrera, Ricardo Bianchini
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Xiao Zhou, Takao Nishizeki
IPPS
1998
IEEE
14 years 2 months ago
Optimal Communication Performance on Fast Ethernet with GAMMA
Abstract. The current prototype of the Genoa Active Message MAchine GAMMA is a low-overhead, Active Messages-based inter-process communication layer implemented mainly at kernel le...
Giuseppe Ciaccio
ISPAN
1997
IEEE
14 years 2 months ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa