Sciweavers

1760 search results - page 166 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
USENIX
2000
13 years 9 months ago
Dynamic Function Placement for Data-Intensive Cluster Computing
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
Khalil Amiri, David Petrou, Gregory R. Ganger, Gar...
SIGADA
1999
Springer
14 years 11 days ago
Redistribution in distributed Ada
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
Scott James
DATASCIENCE
2006
110views more  DATASCIENCE 2006»
13 years 8 months ago
Towards development of a high quality public domain global roads database
There is clear demand for a global spatial public domain roads data set with improved geographic and temporal coverage, consistent coding of road types, and clear documentation of...
Andrew Nelson 0002, Alexander de Sherbinin, France...
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
13 years 8 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang
CODES
2007
IEEE
14 years 2 months ago
A code-generator generator for multi-output instructions
We address the problem of instruction selection for Multi-Output Instructions (MOIs), producing more than one result. Such inherently parallel hardware instructions are very commo...
Hanno Scharwächter, Jonghee M. Youn, Rainer L...