Sciweavers

1923 search results - page 79 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
SIGMETRICS
2010
ACM
181views Hardware» more  SIGMETRICS 2010»
14 years 10 months ago
A unified modeling framework for distributed resource allocation of general fork and join processing networks
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
JPDC
2006
106views more  JPDC 2006»
14 years 9 months ago
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
Matthias Scheutz, Paul W. Schermerhorn
BROADNETS
2007
IEEE
15 years 4 months ago
Computer worm ecology in encounter-based networks
Abstract— Encounter-based network is a frequentlydisconnected wireless ad-hoc network requiring immediate neighbors to store and forward aggregated data for information dissemina...
Sapon Tanachaiwiwat, Ahmed Helmy
GCC
2003
Springer
15 years 3 months ago
Grid Computing for the Masses: An Overview
Abstract. The common goals of the Grid and peer-to-peer communities have brought them in close proximity. Both the technologies overlay a collaborative resource-sharing infrastruct...
Kaizar Amin, Gregor von Laszewski, Armin R. Mikler
PE
2010
Springer
170views Optimization» more  PE 2010»
14 years 8 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale