SCHEDULE: NOV 10-16, 2012
When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.
Gossip-Based Distributed Matrix Computations
SESSION: Research Poster Reception
EVENT TYPE: Posters and Electronic Posters
TIME: 5:15PM - 7:00PM
SESSION CHAIR: Torsten Hoefler
AUTHOR(S):Hana Strakova, Wilfried N. Gansterer
ROOM:East Entrance
ABSTRACT:
Two gossip-based algorithms for loosely coupled distributed networks with potentially unreliable components are discussed a distributed QR factorization algorithm and a distributed eigensolver. Due to their randomized communication restricted only to direct neighbors they are very flexible. They can operate on arbitrary topologies and they can be made resilient against dynamic changes in the network, against message loss or node failures, and against asynchrony between compute nodes. Moreover, their overall cost can be reduced by accuracy-communication trade-offs.
On this poster, first results about the two algorithms with respect to numerical accuracy, convergence speed, communication cost and resilience against message loss or node failures are reviewed and extended, and they are compared to the state-of-the-art.
Due to the growth in the number of nodes for future extreme-scale HPC systems and the anticipated decrease in reliability, some properties of gossip-based distributed algorithms are expected to become very important in the future.
Chair/Author Details:
Torsten Hoefler (Chair) - ETH Zurich
Hana Strakova - University of Vienna
Wilfried N. Gansterer - University of Vienna
Click here to download .ics calendar file
Click here to download .vcs calendar file
Click here to add event to your Google Calendar
Gossip-Based Distributed Matrix Computations
SESSION: Research Poster Reception
EVENT TYPE:
TIME: 5:15PM - 7:00PM
SESSION CHAIR: Torsten Hoefler
AUTHOR(S):Hana Strakova, Wilfried N. Gansterer
ROOM:East Entrance
ABSTRACT:
Two gossip-based algorithms for loosely coupled distributed networks with potentially unreliable components are discussed a distributed QR factorization algorithm and a distributed eigensolver. Due to their randomized communication restricted only to direct neighbors they are very flexible. They can operate on arbitrary topologies and they can be made resilient against dynamic changes in the network, against message loss or node failures, and against asynchrony between compute nodes. Moreover, their overall cost can be reduced by accuracy-communication trade-offs.
On this poster, first results about the two algorithms with respect to numerical accuracy, convergence speed, communication cost and resilience against message loss or node failures are reviewed and extended, and they are compared to the state-of-the-art.
Due to the growth in the number of nodes for future extreme-scale HPC systems and the anticipated decrease in reliability, some properties of gossip-based distributed algorithms are expected to become very important in the future.
Chair/Author Details:
Torsten Hoefler (Chair) - ETH Zurich
Hana Strakova - University of Vienna
Wilfried N. Gansterer - University of Vienna
Click here to download .ics calendar file