Sciweavers

1923 search results - page 73 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
IPPS
2008
IEEE
15 years 4 months ago
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...
Wayne Pfeiffer, Nicholas J. Wright
CAISE
2000
Springer
15 years 2 months ago
CHAOS: An Active Security Mediation System
With the emergence of the Internet, collaborative computing has become more feasible than ever. Organizations can share valuable information among each other. However, certain user...
David Liu, Kincho H. Law, Gio Wiederhold
ICDCS
2010
IEEE
15 years 1 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
15 years 1 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
ICSOC
2010
Springer
14 years 7 months ago
Programmable Fault Injection Testbeds for Complex SOA
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...
Lukasz Juszczyk, Schahram Dustdar