1855 search results - page 297 / 371 » A coding theorem for distributed computation |
149
Voted
EUROPAR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Current approaches to parallel I/O demand extensive user effort to obtain acceptable performance. This is in part due to difficulties in understanding the characteristics...
122
Voted
SPAA
1997
ACM
15 years 7 months ago
1997
ACM
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
131
Voted
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
In order to address the high performance I/O needs of HPC and enterprise applications, modern interconnection fabrics, such as InfiniBand and more recently, 10GigE, rely on network...
126
Voted
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
The visual nature of geometry applications makes them a natural area where visualization can be an effective tool for demonstrating algorithms. In this paper we propose a new mode...
232
click to vote
ECOOP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Because Remote Procedure Calls do not compose efficiently, designers of distributed object systems use Data Transfer and Remote Fac?ade patterns to create large-granulari...