CS Colloquium Series @ UCY
The Department of Computer Science at the University of Cyprus holds research colloquiums and social hours approximately once weekly. All university students, faculty, and staff are invited to attend. Notifications about new and upcoming events are automatically disseminated to a variety of institutional lists.
If you don't receive these notifications, but want to get informed about upcoming colloquium announcements, you can do the following:List RSS Directions
Colloquium Coordinator: Demetris Zeinalipour
Colloquium: Distributed Cooperation and Adversity: Complexity Trade-Offs, Prof. Alexander A. Shvartsman (University of Connecticut, USA), Friday, September 18th, 2009, 16:30-17:30 EET.
The Department of Computer Science at the University of Cyprus cordially invites you to the Colloquium entitled:
Distributed Cooperation and Adversity: Complexity Trade-Offs
Speaker: Prof. Alexander A. Shvartsman
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to undesirable perturbations is one of the fundamental problems in distributed computing, with applications encompassing such important areas as Internet supercomputing, parallel simulation, and multi-agent collaboration. The perturbations in the computing medium are typically due to processor and software failures (benign or malicious), communication breakdowns, and unpredictable delays. Such perturbations become even more prominent when an application needs to harness massive amounts of available computational resources. To develop efficient solutions for computation problems based on distributed cooperation, it is important to understand efficiency trade-offs characterizing the ability of p processors to cooperate on t tasks in key models of computation in the presence of adversity. In this talk we survey historical and recent results for distributed cooperation roughly grouped along the following topics: (i) fundamental failure-sensitive bounds for distributed cooperation problems for synchronous crash-prone processors, (ii) upper and lower bounds on distributed cooperation in shared-memory models, (iii) bounds on distributed work in message-passing models and on redundant work for processors that may experience prolonged absence of communication.
Alexander A. Shvartsman is a Professor and Associate Head in the Department of Computer Science and Engineering at University of Connecticut, USA. He is the Director of the Dependable Distributed Systems Group and of the Voting Technology Research Center. His research interests are in the Principles and Practice of Distributed and Parallel Computing. His research has been funded by several NSF grants, including the NSF Career Award. He has authored more than 120 papers, two books, and several book chapters. Dr. Shvartsman has chaired and served on many program committees of the top conferences in Distributed Computing, he chaired the Steering Committee of DISC (2004-2007), and he is a Vigneron d'Honneur of Jurade de Saint-Emilion. For more info: http://www.cse.uconn.edu/~aas/
|Mailing List: https://listserv.cs.ucy.ac.cy/mailman/listinfo/cs-colloquium|
|Sponsor: The CS Colloquium Series is supported by a generous donation from