This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 3Parallel algorithms
- 2Distributed computing
- 2Message passing
- 1Graph clustering
- 1Simulated
- 1Simulated hypercube
-
1989
Marsland, Tony, Breitkreutz, T., Sutphen, Steven
Technical report TR89-11. This paper explains how to write Network Multiprocessor Package (NMP) applications. The technical report NMP--A Network Multi-processor [TR88-22] contains an overview of NMP, implementation details, more advanced usage information, and instructions for installing the...
-
Graph Clustering: Complexity, Sequential and Parallel Algorithms
1995
Technical report TR95-01. In this thesis we study graph clustering on two well known families of graphs that arise in many applications, namely bipartite and chordal graphs. We study two specific types of clustering problems. On the one hand we seek a partition of the vertex set of a graph into...
-
1988
Marsland, Tony, Sutphen, Steven, Breitkreutz, T.
Technical report TR88-22. The report describes an environment for performing experiments in distributed processing. It replaces an earlier (1985) report, reflecting changes in the system and terminology. Our system offers researchers an easy way to design, implement, and test parallel...