6105 search results - page 70 / 1221 » A Parallel Algorithm for Bound-Smoothing |
CONCURRENCY
1998
14 years 9 months ago
1998
Abstract Advances in high performance computing, communications, and user interfaces enable developers to construct increasingly interactive high performance applications. The Falc...
CG
2010
Springer
14 years 7 months ago
2010
Springer
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
117
click to vote
SIGMETRICS
2002
ACM
14 years 9 months ago
2002
ACM
We describe a new, non-FCFS policy to schedule parallel jobs on systems that may be part of a computational grid. Our algorithm continuously monitors the system (i.e., the intensi...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...
169
click to vote
SIGMOD
2011
ACM
14 years 18 days ago
2011
ACM
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...