Sciweavers

432 search results - page 71 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
78
Voted
PVM
2005
Springer
15 years 2 months ago
Implementing MPI-IO Shared File Pointers Without File System Support
Abstract. The ROMIO implementation of the MPI-IO standard provides a portable infrastructure for use on top of any number of different underlying storage targets. These targets va...
Robert Latham, Robert B. Ross, Rajeev Thakur, Bria...
81
Voted
ANCS
2007
ACM
15 years 1 months ago
Congestion management for non-blocking clos networks
We propose a distributed congestion management scheme for non-blocking, 3-stage Clos networks, comprising plain buffered crossbar switches. VOQ requests are routed using multipath...
Nikolaos Chrysos
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
15 years 3 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha
PODC
2012
ACM
12 years 12 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
ACL
1997
14 years 10 months ago
A Word-to-Word Model of Translational Equivalence
Many multilingual NLP applications need to translate words between different languages, but cannot afford the computational expense of inducing or applying a full translation mode...
I. Dan Melamed