1296 search results - page 24 / 260 » Exploiting communication concurrency on high performance com... |
115
click to vote
GLOBECOM
2008
IEEE
14 years 11 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
81
Voted
COORDINATION
2009
Springer
15 years 11 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
CLUSTER
2008
IEEE
15 years 5 months ago
2008
IEEE
—User-level communication allows an application process to access the network interface directly. Bypassing the kernel requires that a user process accesses the network interface...
102
click to vote
CCGRID
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract— Scientific computing is being increasingly deployed over volunteer-based distributed computing environments consisting of idle resources on donated user machines. A fu...
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
Existing low-latency protocols make unrealistically strong assumptions about reliability. This allows them to achieve impressive performance, but also prevents this performance bei...