Sciweavers

5448 search results - page 647 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
HPCN
1995
Springer
15 years 10 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
ICPP
1995
IEEE
15 years 10 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
IOPADS
1997
94views more  IOPADS 1997»
15 years 8 months ago
Remote I/O Fast Access to Distant Storage
As high-speed networks make it easier to use distributed resources, it becomes increasingly common that applications and their data are not colocated. Users have traditionally add...
Ian T. Foster, David Kohr, Rakesh Krishnaiyer, Jac...
CCGRID
2010
IEEE
15 years 8 months ago
Decentralized Resource Availability Prediction for a Desktop Grid
In a desktop grid model, the job (computational task) is submitted for execution in the resource only when the resource is idle. There is no guarantee that the job which has starte...
Karthick Ramachandran, Hanan Lutfiyya, Mark Perry
CONCUR
2010
Springer
15 years 8 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...