Grid Computing M (2004-2005)
Increasing interest from both the scientific and the more general
large-scale information processing communities motivates the study of
large-scale distributed systems. This module provides both a
practically-oriented introduction to current technologies, focussing on
Grid toolkits, and a principled overview of the deep underlying issues
that arise in supporting large-scale multi-organisation computation.
Aims and Objectives
Grid Computing is a developing area: our understanding of the problem
space is still evolving; systems and standards change frequently; there
are many open research issues; and no-one has all the answers.
Accordingly, we aim to: produce Grid-savvy individuals; encourage critical
thinking about Grid-related technology; and pique your interest in
Grid-related research issues.
Prerequisites
Students are expected to have completed computer science degree-level
studies covering the areas of operating systems, distributed algorithms,
communications and networks, databases, and internet technologies
including web services. For Glasgow MSci and Honours students, this
corresponds to the materials covered in OS3, DAS4, CA4 and NCT4.
Timetable
The module will be taught by Richard Sinnott (module coordinator), John
Watt and Colin Perkins. It is timetabled Monday 12:00-13:00, Thursday
14:00-15:00 and Friday 09:00-10:00 for 10 weeks, starting on 30th
September 2004. There is no set textbook for this module: instead papers
will be handed out during lectures and tutorials (see below for a complete
reading list).
The module will be taught using a mixture of lectures and tutorials.
Some tutorials will be laboratory work, others will be for discussion of
papers handed out during earlier lectures. Discussions will be led by
groups of students assigned to read and present a paper: all students will
be expected to participate in the discussions.
Recommended Reading
Lecture 1:
-
I. Foster and C. Kesselman, Computational Grids, in The Grid: Blueprint
for a Future Computing Infrastructure, I. Foster and C. Kesselman
(Eds), Morgan Kaufmann, 1998.
-
I. Foster, C. Kesselman, and S. Tuecke, The Anatomy of the Grid,
International Journal of Supercomputer Applications, Volume 15, Number
3, 2001.
Lecture 2:
-
I. Foster et al., The Grid2003 Production Grid: Principles and
Practice, Proceedings of the 13th IEEE International Symposium on High
Performance Distributed Computing, 2004.
-
S. Floyd and V. Paxson, Difficulties in Simulating the Internet,
IEEE/ACM Transactions on Networking, Vol. 9, No. 4, August 2001.
-
J. A. Crowcroft, S. M. Hand, T. L. Harris, A. J. Herbert, M. A. Parker
and I. A. Pratt, FutureGRID: A Program for long-term research into GRID
systems architecture, Proceedings of the UK e-Science All Hands
Meeting, Sept 2003.
-
M. Amin, Toward Self-Healing Infrastructure Systems, IEEE Computer,
August 2000.
-
J. O. Kephart and D. M. Chess, The Vision of Autonomic Computing, IEEE
Computer, January 2003.
Lecture 3:
-
I. Foster, C. Kesselman, J. M. Nick and S. Tuecke, The Physiology of
the Grid.
Lecture 4:
-
I. Foster, C. Kesselman, J. Nick and S. Tuecke, Grid Services for
Distributed System Integration, IEEE Computer, Vol. 35, No. 6, June
2002.
-
L. Ferreira et al., Globus Toolkit 3.0 Quick Start, IBM Red Paper,
September 2003.
Lecture 5:
-
K. Czajkowski, S. Fitzgerald, I. Foster and C. Kesselman, Grid
Information Services for Distributed Resource Sharing, Proceedings of
the 10th IEEE International Symposium on High Performance Distributed
Computing, August 2001.
Lecture 6:
-
Sun Microsystems, Web Services Made Easier: The Java APIs and
Architectures for XML, Technical White Papers, June 2002, Revision 3.
Lecture 7:
Lecture 8:
-
P. J. Broadfoot and A. P. Martin, A Critical Survey of Grid Security
Requirements and Technologies, Oxford University Computing Laboratory,
Programming Research Group Technical Report PRG-RR-03-15, 2003.
Lecture 9:
Lecture 10:
-
R. Butler, V. Welch, D. Engert, I. Foster, S. Tuecke, J. Volmer and C.
Kesselman, A National-Scale Authentication Infrastructure, IEEE
Computer, December 2000.
Lecture 11:
-
D. Thain, T. Tannenbaum & M. Livny, Distributed Computing in Practice:
The Condor Experience, to appear in Concurrency and Computation:
Practice and Experience, 2004.
-
K. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S. Martin, W. Smith
and S. Tuecke, A Resource Management Architecture for Metacomputing
Systems, Proceedings of the IPPS/SPDP '98 Workshop on Job Scheduling
Strategies for Parallel Processing, Orlando, FL, USA, March 1998.
-
A. Andrieux, D. Berry, J. Garibaldi, S. Jarvis, J. MacLaren, D.
Ouelhadj and D. Snelling, Open Issues in Grid Scheduling, Proceedings
of the workshop held at the e-Science Institute, Edinburgh, October
2003.
Lecture 12:
Lecture 13:
-
B. Allcock, J. Bester, J. Bresnahan, A. L. Chervenak, I. Foster, C.
Kesselman, S. Meder, V. Nefedova, D. Quesnal, S. Tuecke, Data
Management and Transfer in High Performance Computational Grid
Environments, Parallel Computing Journal, Vol. 28 (5), May 2002, pp.
749-771.
Lecture 14:
Lecture 15:
-
J. Padhye, V. Firoiu, D. Towsley and J. Kurose, Modelling TCP
Throughout: A Simple Model and its Empirical Validation, Proceedings of
SIGCOMM 1998, Vancouver, Canada, September 1998.
-
T. Hacker, B. Athey and B. Noble, The end-to-end performance effects of
parallel TCP sockets on a lossy wide-area network, Proceedings of the
16th IEEE/ACM International Parallel and Distributed Processing
Symposium, Ft. Lauderdale, FL, USA, April 2002.
-
S. Floyd, HighSpeed TCP for Large Congestion Windows, Internet
Engineering Task Force, RFC 3649, Experimental, December 2003.
-
D. Katabi, M. Handley, and C. Rohrs, Internet Congestion Control for
High Bandwidth-Delay Product Networks, Proceedings of SIGCOMM 2002,
Pittsburgh, August, 2002.
Lecture 16:
-
H. Balakrishnan, M. F. Kaashoek, D. Karger, R. Morris and I. Stoica,
Looking up Data in P2P Systems, Communications of the ACM, Vol. 46, No.
2, February 2003.
-
I. Stoica, R. Morris, D. Karger, M. F. Kaashoek and H. Balakrishnan,
Chord: A Scalable Peer-to-Peer Lookup Service for Internet
Applications, Proceedings of ACM SIGCOMM'01, San Diego, CA, USA, August
2001.
-
B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph and J. D.
Kubiatowicz, Tapestry: A Resilient Global-Scale Overlay for Service
Deployment, IEEE Journal on Selected Areas in Communications, Vol. 22,
No. 1, January 2004.
-
S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, A
Scalable Content-Addressable Network, Proceedings of ACM SIGCOMM'01,
San Diego, CA, USA, August 2001.
-
J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels,
R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells and B. Zhao,
OceanStore: An Architecture for Global-Scale Persistent Storage,
Proceedings of the 9th International Conference on Architectural
Support for Programming Languages and Operating Systems, Cambridge, MA,
USA, November 2000.
-
S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao and J.
Kubiatowicz, Pond: The OceanStore Prototype, Proceedings of the 2nd
USENIX Conference on File and Storage Technologies, San Francisco, CA,
USA, April 2003.
-
S. Ratnasamy, M. Handley, R. Karp and S. Shenker, Application-level
Multicast Using Content-Addressable Networks, Proceedings of 3rd
International Workshop on Networked Group Communication, London, UK,
November 2001.
-
R. van Renesse, K. P. Birman, W. Vogels, Astrolabe: A Robust and
Scalable Technology for Distributed System Monitoring, Management, and
Data Mining, ACM Transactions on Computer Systems, Vol. 21, No. 2, May
2003.
Lecture 17:
Lecture 18:
Lecture 19:
-
J. Chin and P. V. Coveney, Towards tractable toolkits for the Grid: a
plea for lightweight, usable middleware, February 2004.
-
K. Czajkowski, D. Ferguson, I. Foster, J. Frey, S. Graham, T. Maguire,
D. Snelling and S. Tuecke, From Open Grid Services Infrastructure to
WS-Resource Framework: Refactoring and Evolution, Version 1.1,
whitepaper 3/05/2004.
Lecture 20:
Credits
This is a level M course, worth 10 credits.
Assessment
The module will be assessed by the combination of a written examination
(70%) and marked coursework (30%). The marked coursework comprises three
problem sets (each worth 5% of the total mark) and a single programming
assignment (worth 15% of the total mark).
Lecture Slides
Coursework
Past exam papers