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.
Hsiang-Tsung Kung is a Taiwanese-born American computer scientist. He is the William H. Gates professor of computer science at Harvard University. His early research in parallel computing produced the systolic array in 1979, which has since become a core computational component of hardware accelerators for artificial intelligence, including Google's Tensor Processing Unit (TPU). Similarly, he proposed optimistic concurrency control in 1981, now a key principle in memory and database transaction systems, including MySQL, Apache CouchDB, Google's App Engine, and Ruby on Rails. He remains an active researcher, with ongoing contributions to computational complexity theory, hardware design, parallel computing, routing, wireless communication, signal processing, and artificial intelligence.
José Manuel Nunes Salvador Tribolet is a Portuguese engineer, and Professor of Information Systems at the Instituto Superior Técnico - University of Lisbon, Portugal, who became known for his work on speech coding in the late 1970s.
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.
Jeffrey Scott Vitter is a U.S. computer scientist and academic administrator. Born in 1955 in New Orleans, Vitter has served in several senior higher education administration posts. He is a former chancellor of the University of Mississippi. He assumed the chancellor position on January 1, 2016. His formal investiture to the chancellorship took place on November 10, 2016, at the University of Mississippi's Oxford Campus.
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".
FELICS, which stands for Fast Efficient & Lossless Image Compression System, is a lossless image compression algorithm that performs 5-times faster than the original lossless JPEG codec and achieves a similar compression ratio.
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.
Search-based software engineering (SBSE) applies metaheuristic search techniques such as genetic algorithms, simulated annealing and tabu search to software engineering problems. Many activities in software engineering can be stated as optimization problems. Optimization techniques of operations research such as linear programming or dynamic programming are often impractical for large scale software engineering problems because of their computational complexity or their assumptions on the problem structure. Researchers and practitioners use metaheuristic search techniques, which impose little assumptions on the problem structure, to find near-optimal or "good-enough" solutions.
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.
Apache Hama is a distributed computing framework based on bulk synchronous parallel computing techniques for massive scientific computations e.g., matrix, graph and network algorithms. Originally a sub-project of Hadoop, it became an Apache Software Foundation top level project in 2012. It was created by Edward J. Yoon, who named it, and Hama also means hippopotamus in Yoon's native Korean language (하마), following the trend of naming Apache projects after animals and zoology. Hama was inspired by Google's Pregel large-scale graph computing framework described in 2010. When executing graph algorithms, Hama showed a fifty-fold performance increase relative to Hadoop.
Ü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 Shanghai-born Chinese 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.
C. A. Murthy (1958–2018) was a senior scientist and higher academic grade Professor of the Indian Statistical Institute, whose primary research contributions were to the fields of pattern recognition, image processing, machine learning, neural networks, fractals, genetic algorithms, wavelets and data mining.
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.
J. J. Garcia-Luna-Aceves is a Mexican-American computer engineer, currently professor at the University of Toronto's Department of Electrical and Computer Engineering. Until 2023, he was the 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 was a Principal Scientist at the Xerox Palo Alto Research Center. He is a Fellow of the IEEE for contributions to theory and design of communication protocols for network routing and channel access and a fellow to 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".
- ↑ Jia, Lujun; Rajaraman, Rajmohan; Suel, Torsten (2002). "An efficient distributed algorithm for constructing small dominating sets". Distributed Computing. 15 (4): 193–205. doi:10.1007/s00446-002-0078-0.
- ↑ Jia, Lujun; Rajaraman, Rajmohan; Suel, Torsten (2002). "An efficient distributed algorithm for constructing small dominating sets". Distributed Computing. 15 (4): 193–205. doi:10.1007/s00446-002-0078-0.
- ↑ pdf from Berkeley [ permanent dead link ]
- ↑ Arge, Lars; Procopiuc, Octavian; Ramaswamy, Sridhar; Suel, Torsten; Scott Vitter, Jeffrey (1998). "Scalable sweeping-based spatial join". VLDB. 98: 570–581.
