Sciweavers

1777 search results - page 273 / 356
» Programming Cryptographic Protocols
Sort
View
HIPC
2007
Springer
14 years 19 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
FPL
2006
Springer
242views Hardware» more  FPL 2006»
14 years 13 days ago
TMD-MPI: An MPI Implementation for Multiple Processors Across Multiple FPGAs
With current FPGAs, designers can now instantiate several embedded processors, memory units, and a wide variety of IP blocks to build a single-chip, high-performance multiprocesso...
Manuel Saldaña, Paul Chow
WSC
1997
13 years 10 months ago
Simulation of Modern Parallel Systems: A CSIM-based Approach
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging ...
Dhabaleswar K. Panda, Debashis Basak, Donglai Dai,...
JTRES
2010
ACM
13 years 9 months ago
Exhaustive testing of safety critical Java
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Pat...
Tomás Kalibera, Pavel Parizek, Michal Maloh...
ESOP
2012
Springer
12 years 4 months ago
Multiparty Session Types Meet Communicating Automata
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Pierre-Malo Deniélou, Nobuko Yoshida