Sciweavers

1053 search results - page 110 / 211
» Estimating Execution Time of Distributed Applications
Sort
View
IPPS
2010
IEEE
15 years 1 months ago
Meta-scheduling in advance using red-black trees in heterogeneous Grids
Abstract--The provision of Quality of Service in Grid environments is still an open issue that needs attention from the research community. One way of contributing to the provision...
Luis Tomás, Carmen Carrión, Blanca C...
ICS
1993
Tsinghua U.
15 years 7 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
CEE
2007
107views more  CEE 2007»
15 years 3 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
RTAS
1999
IEEE
15 years 7 months ago
User Level Scheduling of Communicating Real-Time Tasks
Unique challenges are present when one tries to build distributed real-time applications using standard o -the-shelf systems which are in common use but are not necessarily design...
Chia Shen, Oscar González, Krithi Ramamrith...
CONIELECOMP
2011
IEEE
14 years 6 months ago
DSRP: Distributed SensorWeb Routing Protocol
—We propose a new multi-hop routing protocol for wireless sensor networks, suited for monitoring and control applications. The aim of this research is to adapt flat and hierarch...
Abhinav Valada, David Kohanbash, George Kantor