PUBLIC MARKS with tags cluster & search

Every day, search companies like Google download terabytes of data from the Internet, store it on clusters of thousands of machines, and process it so that it can be easily searched. To make this possible, these companies need sophisticated distributed file system and parallel programing architectures. Have you ever heard of the Map/Reduce distributed parallel programing paradigm? If you are a computer scientist, you should have, because every time you submit a Google search, you are using Map/Reduce. Despite growing demand from companies like Google, Yahoo, and Microsoft, few computer science majors have even heard of Map/Reduce, let alone graduate well versed in its use. Unfortunately, several barriers exist to integrating Map/Reduce into computer science curricula. Obtaining a large cluster, configuring it, and installing complicated distributed file system and parallel programing software is difficult, time consuming, and expensive. In the past, Google's solution to this problem has been to ship entire clusters pre-configured with Map/Reduce software to select universities. In essence, Vdoop does same thing, with exactly the same software, except for our clusters are virtual, and hence free.

Meta Search Engine - Search the web and the Invisible web with 1,000 specifics search engines.

same company as Clusty

Pipeline is a search engine and web portal that combines the result relevance of a PageRank style link algorithm with the navigation utility of results clustering.

APHID is an acronym for Asycnhronous Parallel Hierarchical Iterative Deepening. The APHID game-tree search algorithm attempts to accomplish many goals: * to test out the viability of asynchronous search methods for parallel alpha-beta based search. * to develop an algorithm that works well across all hardware platforms and applications. * to implement a tool that can be easily inserted into legacy sequential search algorithms.