Sciweavers

1923 search results - page 196 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CONTEXT
2003
Springer
15 years 3 months ago
A SAT-Based Algorithm for Context Matching
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
Paolo Bouquet, Bernardo Magnini, Luciano Serafini,...
74
Voted
ICPPW
2005
IEEE
15 years 3 months ago
A Practical Approach to the Rating of Barrier Algorithms Using the LogP Model and Open MPI
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
Torsten Hoefler, Lavinio Cerquetti, Torsten Mehlan...
EDOC
2007
IEEE
15 years 2 months ago
Automated Model-Based Configuration of Enterprise Java Applications
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
Jules White, Douglas C. Schmidt, Krzysztof Czarnec...
CONCUR
2009
Springer
15 years 4 months ago
Query-Based Model Checking of Ad Hoc Network Protocols
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
PVM
2010
Springer
14 years 8 months ago
Efficient MPI Support for Advanced Hybrid Programming Models
The number of multithreaded Message Passing Interface (MPI) implementations and applications is increasing rapidly. We discuss how multithreaded applications can receive messages o...
Torsten Hoefler, Greg Bronevetsky, Brian Barrett, ...