Related Research Articles
A Web crawler, sometimes called a spider or spiderbot and often shortened to crawler, is an Internet bot that systematically browses the World Wide Web and that is typically operated by search engines for the purpose of Web indexing.
Distributed web crawling is a distributed computing technique whereby Internet search engines employ many computers to index the Internet via web crawling. Such systems may allow for users to voluntarily offer their own computing and bandwidth resources towards crawling web pages. By spreading the load of these tasks across many computers, costs that would otherwise be spent on maintaining large computing clusters are avoided.
Scott J. Shenker is an American computer scientist, and professor of computer science at the University of California, Berkeley. He is also the leader of the Extensible Internet Group at the International Computer Science Institute in Berkeley, California.
Shahid H. Bokhari is a highly cited Pakistani researcher in the field of parallel and distributed computing. He is a fellow of both IEEE and ACM. Bokhari's ACM Fellow citation states that he received the award for his "research contributions to automatic load balancing and partitioning of distributed processes", while his IEEE Fellow award recognises his "contributions to the mapping problem in parallel and distributed computing".
A search engine is an information retrieval software program that discovers, crawls, transforms and stores information for retrieval and presentation in response to user queries.
The bulk synchronous parallel (BSP) abstract computer is a bridging model for designing parallel algorithms. It is similar to the parallel random access machine (PRAM) model, but unlike PRAM, BSP does not take communication and synchronization for granted. In fact, quantifying the requisite synchronization and communication is an important part of analyzing a BSP algorithm.
In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges of the original graph that cross between the groups will produce edges in the partitioned graph. If the number of resulting edges is small compared to the original graph, then the partitioned graph may be better suited for analysis and problem-solving than the original. Finding a partition that simplifies graph analysis is a hard problem, but one that has applications to scientific computing, VLSI circuit design, and task scheduling in multiprocessor computers, among others. Recently, the graph partition problem has gained importance due to its application for clustering and detection of cliques in social, pathological and biological networks. For a survey on recent trends in computational methods and applications see Buluc et al. (2013). Two common examples of graph partitioning are minimum cut and maximum cut problems.
Keith Marzullo is the inventor of Marzullo's algorithm, which is part of the basis of the Network Time Protocol and the Windows Time Service. On August 1, 2016 he became the Dean of the University of Maryland College of Information Studies after serving as the Director of the NITRD National Coordination Office. Prior to this he was a Professor in the Department of Computer Science and Engineering at University of California, San Diego. In 2011 he was inducted as a Fellow of the Association for Computing Machinery.
Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting algorithms partitions the array into sub-intervals or buckets. The buckets are then sorted individually and then concatenated together. However, if the array is non-uniformly distributed, the performance of these sorting algorithms can be significantly throttled. Samplesort addresses this issue by selecting a sample of size s from the n-element sequence, and determining the range of the buckets by sorting the sample and choosing p−1 < s elements from the result. These elements then divide the array into p approximately equal-sized buckets. Samplesort is described in the 1970 paper, "Samplesort: A Sampling Approach to Minimal Storage Tree Sorting", by W. D. Frazer and A. C. McKellar.
Sundaraja Sitharama Iyengar is an Indian-born American computer scientist and the Distinguished University Professor, Ryder Professor and Director of Computer Science at Florida International University, Miami, Florida, USA. He also founded and directs the Robotics Research Laboratory at Louisiana State University (LSU). He has been a Visiting Professor or Scientist at Oak Ridge National Laboratory, Jet Propulsion Laboratory, Naval Research Laboratory, and has been awarded the Satish Dhawan Visiting Chaired Professorship at the Indian Institute of Science, the Homi Bhaba Visiting Chaired Professor (IGCAR), and a professorship at the University of Paris (Sorbonne).
Haesun Park is a professor and chair of Computational Science and Engineering at the Georgia Institute of Technology. She is an IEEE Fellow, ACM Fellow, and Society for Industrial and Applied Mathematics Fellow. Park's main areas of research are Numerical Algorithms, Data Analysis, Visual Analytics and Parallel Computing. She has co-authored over 100 articles in peer-reviewed journals and conferences.
In computer science, SimHash is a technique for quickly estimating how similar two sets are. The algorithm is used by the Google Crawler to find near duplicate pages. It was created by Moses Charikar. In 2021 Google announced its intent to also use the algorithm in their newly created FLoC system.
Ümit V. Çatalyürek is a professor of computer science at the Georgia Institute of Technology, and Adjunct Professor in department of Biomedical Informatics at the Ohio State University. He is known for his work on graph analytics, parallel algorithms for scientific applications, data-intensive computing, and large scale genomic and biomedical applications. He was the director of the High Performance Computing Lab at the Ohio State University. He was named Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2016 for contributions to combinatorial scientific computing and parallel computing.
Huan Liu is a Chinese-born computer scientist.
Richard Vuduc is a tenured professor of computer science at the Georgia Institute of Technology. His research lab, The HPC Garage, studies high-performance computing, scientific computing, parallel algorithms, modeling, and engineering. He is a member of the Association for Computing Machinery (ACM). As of 2022, Vuduc serves as Vice President of the SIAM Activity Group on Supercomputing. He has co-authored over 200 articles in peer-reviewed journals and conferences.
Ishfaq Ahmad is a computer scientist, IEEE Fellow and Professor of Computer Science and Engineering at the University of Texas at Arlington (UTA). He is the Director of the Center For Advanced Computing Systems (CACS) and has previously directed IRIS at UTA. He is widely recognized for his contributions to scheduling techniques in parallel and distributed computing systems, and video coding.
Boi Volkert Faltings is a Swiss professor of artificial intelligence at École Polytechnique Fédérale de Lausanne.
Timothy M. Pinkston is an American computer engineer, researcher, educator and administrator whose work is focused in the area of computer architecture. He holds the George Pfleger Chair in Electrical and Computer Engineering and is a Professor of Electrical and Computer Engineering at University of Southern California (USC). He also serves in an administrative role as Vice Dean for Faculty Affairs at the USC Viterbi School of Engineering.
J. J. Garcia-Luna-Aceves is Distinguished Professor of Computer Science and Engineering at University of California at Santa Cruz UCSC, holding the Jack Baskin Endowed Chair of Computer Engineering, is CITRIS Campus Director for UCSC, and is a Principal Scientist at the Xerox Palo Alto Research Center. He is a Fellow of the IEEE and the AAAS.
References
- ↑ Faculty listing, Computer Science and Engineering, New York University Tandon School of Engineering.
- ↑ Torsten Suel at the Mathematics Genealogy Project
- ↑ "Faster Retrieval of Top Hits in Elasticsearch with Block-Max WAND". 5 February 2019.
- ↑ https://scholar.google.com/citations?user=eQUn8ugAAAAJ&hl=en Access date Nov 15, 2012
- 1 2 Hill, Jonathan M.D.; McColl, Bill; Stefanescu, Dan C.; Goudreau, Mark W.; Lang, Kevin; Rao, Satish B.; Suel, Torsten; Tsantilas, Thanasis; Bisseling, Rob H. (1998). "BSPlib: The BSP programming library" (PDF). Parallel Computing. 24 (14): 1947–1980. CiteSeerX 10.1.1.48.5132 . doi:10.1016/S0167-8191(98)00093-3. hdl:1874/378687.
- ↑ "BSPlib: The BSP programming library".
- ↑ pdf at Emory
- ↑ "Optimal histograms with quality guarantees".
- ↑ pdf from Poly Archived 2004-11-06 at the Wayback Machine
- ↑ "Design and implementation of a high-performance distributed web crawler".
- ↑ SpringerLink
- ↑ "An efficient distributed algorithm for constructing small dominating sets".
- ↑ pdf from Berkeley [ permanent dead link ]
- ↑ GoogleScholar
| Authority control: Scientific databases |
|---|
