Sciweavers

1901 search results - page 61 / 381
» Models and Scheduling Mechanisms for Global Computing Applic...
Sort
View
IPPS
2006
IEEE
15 years 10 months ago
Schedulability analysis of non-preemptive recurring real-time tasks
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
Sanjoy K. Baruah, Samarjit Chakraborty
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 7 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
KI
1998
Springer
15 years 8 months ago
From Theory to Practice in Multiagent System Design: The Case of Structural Co-operation
Abstract. In Distributed Problem-solving (DPS) systems a group of purposefully designed computational agents interact and co-ordinate their activities so as to jointly achieve a gl...
Sascha Ossowski, Ana García-Serrano, Jos&ea...
PPPJ
2006
ACM
15 years 10 months ago
Enabling Java mobile computing on the IBM Jikes research virtual machine
Today’s complex applications must face the distribution of data and code among different network nodes. Java is a wide-spread language that allows developers to build complex so...
Giacomo Cabri, Letizia Leonardi, Raffaele Quitadam...
ANSS
2002
IEEE
15 years 9 months ago
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling tech...
Helen D. Karatza