Sciweavers

112 search results - page 20 / 23
» Message passing without send-receive
Sort
View
117
Voted
HPDC
2005
IEEE
15 years 9 months ago
Collective caching: application-aware client-side file caching
Parallel file subsystems in today’s high-performance computers adopt many I/O optimization strategies that were designed for distributed systems. These strategies, for instance...
Wei-keng Liao, Kenin Coloma, Alok N. Choudhary, Le...
167
Voted
CONCUR
2005
Springer
15 years 9 months ago
Concurrent Clustered Programming
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
Vijay A. Saraswat, Radha Jagadeesan
141
Voted
SIGMETRICS
2004
ACM
105views Hardware» more  SIGMETRICS 2004»
15 years 9 months ago
A model of BGP routing for network engineering
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
Nick Feamster, Jared Winick, Jennifer Rexford
172
Voted
EUROPAR
2003
Springer
15 years 9 months ago
KOJAK - A Tool Set for Automatic Performance Analysis of Parallel Programs
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
Bernd Mohr, Felix Wolf
148
Voted
SIGADA
1999
Springer
15 years 8 months ago
Redistribution in distributed Ada
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
Scott James