Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJune 2001
Peer to peer and distributed computing
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programmingPage 143https://doi.org/10.1145/379539.379594Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 7 - ArticleJune 2001
LogGPS: a parallel computational model for synchronization analysis
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programmingPages 133–142https://doi.org/10.1145/379539.379592We present a new parallel computational model, named LogGPS, which captures synchronization.
The LogGPS model is an extension of the LogGP model, which abstracts communication on parallel platforms. Although the LogGP model captures long messages with ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 7 - ArticleJune 2001
Statistical scalability analysis of communication operations in distributed applications
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programmingPages 123–132https://doi.org/10.1145/379539.379590Current trends in high performance computing suggest that users will soon have widespread access to clusters of multiprocessors with hundreds, if not thousands, of processors. This unprecedented degree of parallelism will undoubtedly expose scalability ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 7 - ArticleJune 2001
Efficiency vs. portability in cluster-based network servers
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programmingPages 113–122https://doi.org/10.1145/379539.379589Efficiency and portability are conflicting objectives for cluster-based network servers that distribute the clients' requests across the cluster based on the actual content requested. Our work is based on the observation that this efficiency vs. ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 7 - ArticleJune 2001
Parallel programming challenges for Internet-scale computing (entropia)
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programmingPage 82https://doi.org/10.1145/379539.379575Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 7 - ArticleJune 2001
Dynamic adaptation to available resources for parallel computing in an autonomous network of workstations
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programmingPages 72–81https://doi.org/10.1145/379539.379572Networks of workstations (NOWs), which are generally composed of autonomous compute elements networked together, are an attractive parallel computing platform since they offer high performance at low cost. The autonomous nature of the environment, ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 7 - ArticleJune 2001
Accurate data redistribution cost estimation in software distributed shared memory systems
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programmingPages 62–71https://doi.org/10.1145/379539.379570Distributing data is one of the key problems in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in programs where data redistribution between computational phases is considered. The global data ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 7 - ArticleJune 2001
Parallel computing in 2010: opportunities and challenges in a networked world
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programmingPage 1https://doi.org/10.1145/379539.379546Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 7
