Open Access
QueueLinker: A Framework for Parallel Distributed Data-Stream Processing
Takanori Ueda
- 01 Jan 2012
3
TL;DR: This research started as part of a big project led by Prof. Yamana, and the completion of this research would have been a far more difficult task without his help.
read more
Abstract: Acknowledgements Firstly, I would like to express my immense gratitude toward my supervisor, Prof. research started as part of a big project led by him. Without the help and guidance of Prof. Yamana, the completion of this research would have been a far more difficult task. The state-of-the-art computer resources in our laboratory, which were essential for carrying out my research, are a result of his dedicated efforts. Prof. Yamana also encouraged me to give many conference presentations and conduct a variety of academic activities, and these gave me the opportunity to harness my skills and create personal connections. I would also like to express my gratitude to Prof. Y Yoichi Muraoka and Prof. University. I received a great deal of advice for this doctor thesis from them. Their deep knowledge of operating systems and parallel distributed computing led to enlightening discussions that helped me to better understand my subject. In addition, international conferences and business trips with them provided many valuable experiences of foreign societies. Dr. A Andrew Sohn, associate professor at the New Jersey Institute of Technology, gave much-appreciated advice for my research. In addition to him, my research career has been supported by many people outside Waseda University. Dr. H Hideyuki Kawashima, assistant professor at Tsukuba University, gave me a great deal of support and many academic opportunities. Drinking parties with him are always interesting. Science and Technology, provided many opportunities for my research career. A big project on distributed computing with him deeply affected my research. This experience with actual products provided me with great experience that could not have been achieved in my university. Moreover, the intern experience gave me an understanding of the importance of database systems. Here, I would also like to thank all of the members of Prof. Yamana's laboratory. ii In particular, I would like to thank Mr. K have graduated from the laboratory, and Mr. K Kou Satoh, who is currently my junior colleague. It would not have been possible to develop the Web crawler without their help. In addition, Mr. H Hiroaki Asai provided me with valuable Web data, including the Twitter streams that were indispensable in developing and testing my framework. Mr. Yusuke Yamamoto helped my research and managed the large number of servers. Mr. H Hiromasa Takei has a deep knowledge of mathematics, and discussions with him provided many interesting research ideas. I would also like to …
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
References
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
- 06 Dec 2004
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
Space/time trade-offs in hash coding with allowable errors
TL;DR: Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
Models and issues in data stream systems
Brian Babcock,Shivnath Babu,Mayur Datar,Rajeev Motwani,Jennifer Widom +4 more
- 03 Jun 2002
TL;DR: The need for and research issues arising from a new model of data processing, where data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, time-varying data streams are motivated.
Dryad: distributed data-parallel programs from sequential building blocks
Michael Isard,Mihai Budiu,Yuan Yu,Andrew Birrell,Dennis Fetterly +4 more
- 21 Mar 2007
TL;DR: The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between vertices.