FU Math/Inf


Springe direkt zu: Inhalt


Service-Navigation


Hauptnavigation/Hauptmenü: Links auf direkt erreichbare, übergeordnete Webseiten


Secure Identity
Institut für Informatik

Suche auf der Website http://www.inf.fu-berlin.de

Schnellzugriff

Für Browser ohne JavaScript finden Sie hier eine Liste der Quick Links

Navigation/Menü: Links auf weitere Seiten dieser Website


Für diese Seite

Fachbereich »  Informatik »  Secure Identity »  Teaching »  Algorithmen und Programmieren V: Netzprogrammierung

Instructors

Description

This course introduces students to the development of distributed applications using the message passing and remote procedure call paradigms. Among the topics we will cover are: client-server architectures, socket programming, remote procedure calls with Java RMI, data representations such as XML and HTML, HTTP communication, JavaScript, CGI, Servlets, JSP. We also introduce concepts such as parallel computations in a network of computers, tuple spaces and peer-to-peer systems.

Prerequisites: Algorithmen und Programmierung IV

Time and Location

Lectures:

Tutorials:

Note: The tutorials commence in the second week of the semester.

Grading

Admission to the exam requires a score of at least 50% on n-2 home work assignments (where n is the overall number of homework assignments). The grade will be computed as follows:

Homework assignments

Homework assignments must be uploaded to a Subversion repository.

Here are the user names of the TAs:

Create a package for each homework assignment (ueb1, ueb2, ...). In the package, create a folder abgaben. Place your solutions into this folder, using the names ueb1.pdf et cetera.

Be repared to generate JUnit tests for your implementations.

Lectures

Tue Oct 13, 2009

Topics:

Reading assignments: [1] [2] [3]

Tue Oct 20, 2009

Topics:

Material:

Reading assignments: [4]

Tue Oct 27, 2009

Topics:

Material:

Tue Nov 3, 2009

Guest speaker: Patrick Lauke, Opera Software ASA

This talk is part of the Opera Software University Tour. Mr. Lauke is a Web Developer and Web Evangelist in Opera's Developer Relations Team. He will share insights about the Web and provide perspectives on technology trends.

Topics:

Tue Nov 10, 2009

Topics:

Reading assignments: [5]

Tue Nov 17, 2009

Topics:

Material:

Tue Nov 24, 2009

Topics:

Tue Dec 1, 2009

Topics:

Tue Dec 8, 2009

Topics:

Tue Dec 15, 2009

Topics:

Tue Jan 5, 2010

Topics:

Tue Jan 12, 2010

Topics:

Tue Jan 19, 2010

Topics:

Tue Jan 26, 2010

Topics:

Tue Feb 2, 2010

Topics:

Tue Feb 9, 2010

Final exam

Literature

  1. Gilbert, S. and Lynch, N. 2002. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33, 2 (Jun. 2002), 51-59. Also available here.
  2. W. Vogels. Eventually consistent. Commun. ACM 52, 1 (Jan. 2009), 40-44.
  3. Julian Browne. Brewer's CAP Theorem. Blog post available online. Version of January 11, 2009.
  4. Mike Muuss. The story of the PING program.
  5. A. D. Birrell and B. J. Nelson. Implementing remote procedure calls. ACM Trans. Comput. Syst. 2, 1 (Feb. 1984), 39-59. Also available here


©2007-2009  AG SI |  Feedback  |
Last Update: Dez 23, 2009

These Pictures are only displayed on print previews: