In the ﬁrst part, you will complete a partially-implemented web crawler program. In the second, you will use Java classes from the package java.util.concurrent to divide the workload among multiple threads of control.
Download the starting code in this zip ﬁle. Inside the src directory are two
subdirectories: spider contains the (partially complete) sequential web crawler for use with Part
1, and concurrentSpider contains the threaded web crawler code for use with Part 2. This code
uses classes from the Java class library for parsing HTML ﬁles and pulling out links (java.net.url among others).
Part 1 – Sequential Web Crawler.
In this part, you will complete a program that is able to “crawl the web” starting from a given URL. A detailed problem speciﬁcation and descriptions of the provided classes can be found in the ﬁrst section of Concurrent Data Structures in Java. Complete the tasks given in the To Do sections and the Try This section.
The ﬁnished program should output the URLs it processes as it crawls the website.
Capture this output in a ﬁle.
There will be a check-in date to make sure nobody is waiting until the last minute to complete this part. I will ask for copy of your Spider.java ﬁle to ensure everyone is making progress.
Part 2 – Multi-threaded Web Crawler.
Production-quality web crawlers divide the work of following links from multiple web pages among multiple versions of themselves, using a Java (and operating system) concept called threads (you used threads in CSci 157 whenever you programed ActiveObjects). Each thread must share the data structures being used, which can cause problems if (for example) two instances try to remove from the work queue at the same time. Because our Queue implementations are not thread-safe, they cannot be used in this version. Instead, we can use implementations provided by the Java package java.util.concurrent. Unfortunately the interface these classes implement is different from the QueueInterface. For example, the method add is used instead of enqueue, and peek or poll instead of dequeue.
A detailed problem speciﬁcation can be found in the second section of Concurrent Data Structures in Java. An outline of the concurrent solution and the problems that concurrent data structures solve can be found in the third section. Complete the tasks given in the To Do sections and the Try This section of section two.
For this project you will turn in:
a README ﬁle for each part, containing SHORT instructions on how to compile and run each program and a description of any issues or known bugs. You do not need to describe the program itself.
all Java ﬁles required to build and run the program(s), using the same ﬁle structure as the provided zip ﬁle
These ﬁles are to be turned in as follows: zipped into a single archive ﬁle, emailed to me.
Do not include binary ﬁles (such as .class ﬁles); sometimes Gmail ﬂags those as malware and won’t send them.