Sciweavers

1055 search results - page 46 / 211
» Computing Real Time Jobs in P2P Networks
Sort
View
IWNAS
2008
IEEE
15 years 11 months ago
Parallel Job Scheduling with Overhead: A Benchmark Study
We study parallel job scheduling, where each job may be scheduled on any number of available processors in a given parallel system. We propose a mathematical model to estimate a j...
Richard A. Dutton, Weizhen Mao, Jie Chen, William ...
ICNS
2009
IEEE
15 years 2 months ago
A BitTorrent Performance Evaluation Framework
In the last decade, file sharing systems have generally been dominated by P2P solutions. Whereas e-mail and HTTP have been the killer apps of the earlier Internet, a large percent...
Razvan Deaconescu, Razvan Rughinis, Nicolae Tapus
CN
2008
117views more  CN 2008»
15 years 4 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
COR
2007
81views more  COR 2007»
15 years 4 months ago
Job scheduling methods for reducing waiting time variance
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
Nong Ye, Xueping Li, Toni Farley, Xiaoyun Xu
ICPP
1993
IEEE
15 years 8 months ago
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job
Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with fro...
Sameer M. Bataineh, Te-Yu Hsiung, Thomas G. Robert...