Sciweavers

52 search results - page 1 / 11
» Finding Predictive Runs with LAPS
Sort
View
91
Voted
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
15 years 4 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan
ICPP
1997
IEEE
15 years 1 months ago
The Affinity Entry Consistency Protocol
In this paper we propose a novel software-only distributed sharedmemory system (SW-DSM), the Affinity Entry Consistency (AEC) protocol. The protocol is based on Entry Consistency ...
Cristiana Bentes Seidel, Ricardo Bianchini, Claudi...
103
Voted
CLUSTER
2002
IEEE
14 years 10 months ago
Online Prediction of the Running Time of Tasks
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
Peter A. Dinda
93
Voted
IPPS
1999
IEEE
15 years 2 months ago
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
Warren Smith, Valerie E. Taylor, Ian T. Foster
IPPS
1998
IEEE
15 years 2 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser