Sciweavers

3098 search results - page 410 / 620
» On distributed smooth scheduling
Sort
View
TSMC
1998
90views more  TSMC 1998»
15 years 6 months ago
Redundancy problem in writing: from human to anthropomorphic robot arm
Abstract—This paper presents the analysis of motion of a redundant anthropomorphic arm during the writing. The modeling is based on the separation of the prescribed movement into...
Veljko Potkonjak, Mirjana Popovic, Mihailo Lazarev...
SPAA
2009
ACM
16 years 7 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
IPPS
2008
IEEE
16 years 29 days ago
A modeling approach for estimating execution time of long-running scientific applications
In a Grid computing environment, resources are shared among a large number of applications. Brokers and schedulers find matching resources and schedule the execution of the applic...
Seyed Masoud Sadjadi, Shu Shimizu, Javier Figueroa...
IPPS
2007
IEEE
16 years 25 days ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
HCW
2000
IEEE
15 years 11 months ago
Combining Workstations and Supercomputers to Support Grid Applications: The Parallel Tomography Experience
Computational Grids are becoming an increasingly important and powerful platform for the execution of largescale, resource-intensive applications. However, it remains a challenge ...
Shava Smallen, Walfredo Cirne, Jaime Frey, Francin...