Sciweavers

1792 search results - page 218 / 359
» Improved scheduling in rings
Sort
View
INFOCOM
2008
IEEE
15 years 5 months ago
On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we presen...
Ulas C. Kozat
SAINT
2007
IEEE
15 years 5 months ago
Data Management on Grid Filesystem for Data-Intensive Computing
In parallel computing environments such as HPC clusters and the Grid, data-intensive applications involve large overhead costs due to a concentration of access to the files on co...
Hitoshi Sato, Satoshi Matsuoka
CPAIOR
2007
Springer
15 years 5 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
MIDDLEWARE
2007
Springer
15 years 5 months ago
Semantics-based grid resource management
Scheduling parallel and distributed applications efficiently onto grid environments is a difficult task and a great variety of scheduling heuristics have been developed aiming to ...
Alexandre Ceasar Tavares Vidal, Francisco Jos&eacu...
WEBDB
2007
Springer
126views Database» more  WEBDB 2007»
15 years 5 months ago
Towards a Content-Provider-Friendly Web Page Crawler
Search engine quality is impacted by two factors: the quality of the ranking/matching algorithm used and the freshness of the search engine’s index, which maintains a “snapsho...
Jie Xu, Qinglan Li, Huiming Qu, Alexandros Labrini...