Homework #2

Due: 7 Mar 2008, 23:59 PST


Homework must be submitted electronically to . It should have a subject of “Homework 2.” You must submit ASCII text without embedded formatting commands or markup. That means, among other things, no postscript, no Microsoft Word, no PDF, no FrameMaker, no TeX, no groff, no DocBook, no HTML, no XML, and no JavaDoc. Do not submit your homework as an attachment to your e-mail. Do not base 64 encode it. Do not Rot13 encode it. Plain ASCII text. You may PGP sign it, but are not required to do so. Do not PGP encrypt it. If you submit something that is not unmarked-up ASCII, it is functionally the same as turning nothing in.

Homework turned in on the due date is not penalized, one day late is 25% off (that is the grade will be multiplied by 0.75), 2 days late is 50% off, and 3 days late is 75% off. No work will be accepted more than 3 days late. I will generally use the Date: line of the mail, but should the situation merit it, I am not above looking through mail system logs to confirm the submission time. I should not have to mention it, but forging a Date: line to avoid a late deduction is grounds for an F.

Do the work yourself. Computer science is a collaborative science, and I encourage you to talk over the ideas in the homework with other students. However, the final submission, that is, the text of the homework, must be composed individually by each student. If you hand in homework that is identical to another student, you risk failing the class. (In fact the only way that you would not fail the class in such a circumstance would be if one student had copied another student without the knowledge of the copied student; the copied student would not be penalized.) That is an awfully large risk for 10% of your total grade. Do the work yourself.

As with all work for csci555, this work is subject to the USC code of Student Conduct. Read it, learn it, live it. Should you have any questions on how to apply the code, do not hesitate to contact me or the Office of Student Judicial Affairs and Community Standards. Should it prove possible, do not plagiarize work from sources outside the class. Plagiarizing homework is grounds for failing the class. It is perfectly all right to properly cite external sources, should you find some that are useful.

Answers will not be graded on their beauty of expression. Answers will be graded on whether they show a logical approach and sensible explanation. Short, simple sentences are fine. What is important is that your ideas are clear to the reader, and that they answer the question. Of course, no answer will be penalized because it is beautifully expressed, either.

Each question has equal weight.

Homework

1.

In general, attribute-based names are more difficult to resolve than hierarchical names. Explain why. Given that resolution is more difficult, what property makes attribute-based names attractive? You may find an example helpful in your answer.

2.

Consider an alternative implementation of the tracer in Connections.[Soules05] Rather than collecting real time information, the tracer walks the file system and collects access times from the files and correlates them. Explain an advantage and a disadvantage of this implementation.

3.

The Weighted Voting[Gifford79] paper mentions that the system can continue to operate in the face of representative failures. Explain more specifically how representative failures affect the ability to read or write files.

4.

In the Domain Name System[Mockapetris87], the amount of time that client data can be inconsistent is affected by the caching time-to-live (TTL) values. These are under the control of the sub-domain administrator. Explain how the administrator of a sub-domain can modulate to TTL to reduce the impact of a large change to the sub-domain when the timing of the change is known in advance.

References

[Soules05] Craig A. Soules and Gregory R. Ganger, “Connections: using context to enhance file search,” 20th ACM symposium on Operating systems principles, ACM Press, 2005, 119-132,

[Gifford79] David K. Gifford, “Weighted Voting for Replicated Data,” Seventh Symposium on Operating Systems Principles, ACM, December 1979, 150-162,

[Mockapetris87] Paul Mockapetris, “Domain Names - Concepts And Facilities,” RFC-1034, November 1987,

Valid XHTML 1.0!
This page written and maintained by Ted Faber
Please mail me any problems with, or comments about this page.
PGP keys local copy