Sciweavers

5448 search results - page 425 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
2003
IEEE
16 years 3 days ago
Performance Prediction of Paging Workloads Using Lightweight Tracing
A trace of a workload’s system calls can be obtained with minimal interference, and can be used to drive repeatable experiments to evaluate system configuration alternatives. R...
Ariel N. Burton, Paul H. J. Kelly
IPPS
2003
IEEE
16 years 3 days ago
New Dynamic Heuristics in the Client-Agent-Server Model
MCT is a widely used heuristic for scheduling tasks onto grid platforms. However, when dealing with many tasks, MCT tends to dramatically delay already mapped task completion time...
Yves Caniou, Emmanuel Jeannot
IPPS
2003
IEEE
16 years 3 days ago
Ad Hoc Networks: A Protocol for Supporting QoS Applications
A delay-bounded service in wireless ad hoc networks is challenging, as ad hoc networks do not provide any type of guarantees. Several protocols have been proposed to support appli...
Lorenzo Donatiello, Marco Furini
IPPS
2003
IEEE
16 years 3 days ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
CCGRID
2002
IEEE
15 years 11 months ago
A Malleable-Job System for Timeshared Parallel Machines
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
Laxmikant V. Kalé, Sameer Kumar, Jayant DeS...