Sciweavers

1316 search results - page 230 / 264
» A New Scheduling Algorithm for Servers
Sort
View
PLDI
2005
ACM
14 years 2 months ago
Scalable statistical bug isolation
We present a statistical debugging algorithm that isolates bugs in programs containing multiple undiagnosed bugs. Earlier statistical algorithms that focus solely on identifying p...
Ben Liblit, Mayur Naik, Alice X. Zheng, Alexander ...
GIS
2007
ACM
14 years 26 days ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
SIAMSC
2008
129views more  SIAMSC 2008»
13 years 9 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ï¬...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
CC
2006
Springer
124views System Software» more  CC 2006»
14 years 22 days ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...