Sciweavers

4533 search results - page 145 / 907
» Prediction Services for Distributed Computing
Sort
View
IPPS
2006
IEEE
14 years 3 months ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas
PERCOM
2006
ACM
14 years 8 months ago
Meta Service Discovery
Meta service discovery is used to find and select a service discovery mechanism by context. As multiple service discovery mechanisms (SDM) proliferate across various administrativ...
John F. Buford, Alan Brown, Mario Kolberg
CCGRID
2004
IEEE
14 years 27 days ago
Predicting job start times on clusters
In a Computational Grid which consists of many computer clusters, job start time predictions are useful to guide resource selections and balance the workload distribution. However...
Hui Li, David L. Groep, Jeffrey Templon, Lex Wolte...
SIGCOMM
2010
ACM
13 years 9 months ago
Trust no one: a decentralized matching service for privacy in location based services
We propose a new approach to ensure privacy in location based services, without requiring any support from a"trusted" entity. We observe that users of location based ser...
Sharad Jaiswal, Animesh Nandi
IPPS
2000
IEEE
14 years 23 days ago
Fault Tolerant Wide-Area Parallel Computing
Executing parallel applications across distributed networks introduces the problem of fault tolerance. A viable solution for fault tolerance must keep overhead manageable and not c...
Jon B. Weissman