Sciweavers

1053 search results - page 94 / 211
» Estimating Execution Time of Distributed Applications
Sort
View
ASPLOS
1992
ACM
15 years 4 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
PDP
2009
IEEE
15 years 6 months ago
Two Formal Semantics of a Subset of the Paderborn University BSPlib
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
Frédéric Gava, Jean Fortin
DMIN
2006
122views Data Mining» more  DMIN 2006»
15 years 1 months ago
Cost-Sensitive Analysis in Multiple Time Series Prediction
- In this paper we propose a new methodology for Cost-Benefit analysis in a multiple time series prediction problem. The proposed model is evaluated in a real world application bas...
Chamila Walgampaya, Mehmed M. Kantardzic
EUROPAR
2009
Springer
15 years 4 months ago
A New Genetic Algorithm for Scheduling for Large Communication Delays
Abstract. In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communicatio...
Johnatan E. Pecero, Denis Trystram, Albert Y. Zoma...
MASCOTS
2003
15 years 1 months ago
Bottleneck Estimation for Load Control Gateways
Providing Quality of Service (QoS) to inelastic data transmissions in a cost-efficient, highly scalable, and realistic fashion in IP networks remains a challenging research issue....
Krishna Pandit, Jens Schmitt, Martin Karsten, Ralf...