Sciweavers

1305 search results - page 135 / 261
» Dynamic House Allocation
Sort
View
105
Voted
IPPS
2006
IEEE
15 years 9 months ago
ReConfigME: a detailed implementation of an operating system for reconfigurable computing
Reconfigurable computing applications have traditionally had the exclusive use of the field programmable gate array, primarily because the logic densities of the available devices...
Grant B. Wigley, David A. Kearney, Mark Jasiunas
PVM
1997
Springer
15 years 7 months ago
Performance of CAP-Specified Linear Algebra Algorithms
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
Marc Mazzariol, Benoit A. Gennart, Vincent Messerl...
115
Voted
EOR
2006
58views more  EOR 2006»
15 years 3 months ago
Bucket brigades revisited: Are they always effective?
Previous work on the dynamics of bucket brigades has focused on systems in which workers can be ordered with respect to their speeds and where this ordering does not change throug...
Dieter Armbruster, Esma Senturk Gel
JCSS
2008
81views more  JCSS 2008»
15 years 3 months ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
145
Voted
WINE
2009
Springer
184views Economy» more  WINE 2009»
15 years 10 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...