Personal tools
You are here: Home Courses Previous Weekly seminar on Distributed Systems

Weekly seminar on Distributed Systems

last modified Feb 16, 2010 05:20 PM

Seminar Fall 2009/2010

 

  1. 09.09 Introductory seminar, theme proposals
  2. 16.09 Satish Srirama, Mobile Enterprise & Cloud Computing
  3. 23.09 Ulrich Norbisrath, Death by Powerpoint; Slot allocation
  4. 07.10 Uddin Misbah, OTR - an overview
  5. 14.10 Ain Uljas, Multithreaded Algorithms for Processing Massive Graphs, (algorithm)
  6. 21.10 Vladimir ŠorAmazon EC2 & Eucalyptus
  7. 28.10 Shohel Era of Cloud Computing; Jürmo Mehine, User Stories
  8. 30.10 (FRI) Silver Aabjõe, Virtualisation Techniques? - Absent; Artjom Lind, P2P technologies;
  9. 04.11 Dmitri Danilov, TBA; Vilen Looga, Hadoop;
  10. 11.11 Pelle Jakovits, GraphGrep; Murad Kamalov, Parallel and Distributed Information Retrieval
  11. 18.11 Indrek Bauvald, Ant Colony Optimization; Maido Käära, NAT Port Mapping Protocol
  12. 25.11 Artjom Lind, P2P technologies 2; Georg Singer, TBA
  13. 02.12 Murad Kamalov, Query Operations; Uddin Misbah, On Implementing Multi-Party OTR in F2F Computing
  14. 04.12 (FRI)  Vilen Looga, Hadoop Continued...; Shohel Cloud Applications & Security
  15. 09.12 Dmitri Danilov, Survey graph databases; Pelle Jakovits, Hamburg - graph processing in Hadoop
  16. 11.12 (FRI) Artjom Lind & Oleg Knut, Next generation of F2F;
  17. 16.12 Georg Singer, Advanced Message Management System; Vladimir Šor, Load balancing

 DS Seminar statistics

Possible themes with some suggested materials to start with

  • HPC, algorithms related to Scientific Computing and Numerical methods (eero at ut.ee)
    • Petascale Computing Examples. (Separate chapters from the book edited by David A. Bader "Petascale Computing", Chapman & Hall/CRC 2008)
    • Ant colony algorithms and their parallelization (resources from the web)
    • Basic Ideas of Domain Decomposition (chapter 1 in book: A. Toselli, O.Widlund, Domain Decomposition Methods - Algorithms and Theory, Springer, 2005.)
    • Asynchronous Domain Decomposition methods (paper by Laitinen, Lapin, Piäskä etc.)
    • Basics of Finite Element Method (first chapters in book: B.Lucquin, O. Pironneau, Introduction to Scientific Computing, Wiley, 1998.)
  • Knowledge Management and Information Retrieval (ulno)
    • chapters from the book "Search User Interfaces"
    • survey graph databases (1-2)
      • Neo4J
      • RDF
      • Sesame
    • Quality measurement of search (topics about search metrics from lewandowski) (1-2)
      • D. Lewandowski, “The retrieval effectiveness of web search engines considering results descriptions,” Journal of Documentation,  vol. 64, 2008, pp. 915–937.
      • D. Lewandowski and N. Höchstötter, “Web searching: a quality measurement perspective,” Web Searching: Interdisciplinary Perspectives. Springer, Dordrecht, 2007.
    • Parallel and Distributed IR (in Modern IR) (1)
    • Query Operations, esp. clustering (in Modern IR) (1)
    • Exploratory Search (Microsoft paper) (1)
      • R.W. White and R.A. Roth, “Exploratory Search: Beyond the Query-Response Paradigm,” Synthesis Lectures on Information Concepts, Retrieval, and Services,  vol. 1, 2009, pp. 1–98.
      • G. Marchionini, “Exploratory search: from finding to understanding,” Communications of the ACM,  vol. 49, 2006, pp. 41–46.
    • Hamburg, research and present pro and cons for knowledge storage
      • http://wiki.apache.org/hadoop/Hamburg
    • Prolog and Graphs
      • G.K. Palshikar, “Representation and Execution of a Graph Grammar in Prolog,” Lecture Notes in Computer Science,  vol. 4670, 2007, p. 442.
      • S. Greco and C. Molinaro, “Querying and repairing inconsistent databases under three-valued semantics,” Lecture Notes in Computer Science,  vol. 4670, 2007, p. 149.
  • F2F Computing
    • UPNP for NAT traversal (1)

    • Apple NAT-PMP (1)

    • Latest P2P Technologies (comparison with F2F, 2 talks) - taken by Artjom Lind

  • ps3
    • survey about math libraries, facilitating the Cell processor (1)
  • Cloud Computing (satish.srirama at ut.ee)
    • virtualization survey (1-3)
      • vmware
      • xen
      • kvm
      • hypervisors
      • opennebula
      • qemu
      • virutalbox (sun)
      • microsoft
      • ibm
    • cloud platforms survey (1-2)
      • EC2 (Amazon)
      • Google Apps (Google)
      • Private Cloud (IBM)
      • Azure (Microsoft)
      • salesforce.com
      • HP, Nec?
    • Mashup Survey (1)
      • Mashup technologies
    • Hadoop (1)
      • Hamburg (1)
  • misc
    • User Stories: Summary of Part 1 of User Stories Applied

Credit points

 

Basic rules:

(1eap=ca 30 hours work)

Participation requirement: at least 90% (more than 10% of unexcused absence will lead to failure of the course and give you no credits - coming unexcused more than 15 minutes late will be counted as an absence)

 

MSC and BSC students:

1eap -- preparing and giving a talk

2nd semester: 2eap -- talk + written work + reviewing a peered student

3eap -- 2 talks, 1 written work, reviewing a peer

 

Written work = at least 15 pages

Reviewing = review multiple versions of talks and written work of one person

 

PhD students:

4 or 5 eap: Status report talk and one extensive talk for at least 60 minutes, reviewing of three peers (talks + writing), a 20 pages paper

 

Talks spring 2008

 

  1. 11.02 Introductory seminar, theme proposals
  2. 18.02 Vladimir Šor, Scientific wrkflows: Kepler 1.0 and Triana 3.2.3
  3. 04.03 Ulrich Norbisrath, Academic writing, presentation, and reviewing, Results are at here
  4. 11.03 cancelled
  5. 18.03 Oleg Knut, LLVM in depth, examples and backend
  6. 25.03 12:00-17:00 Visit to the Flight Simulator at Tartu Airport
  7. 01.04 Oleg Batrashev and Artjom Lind, Git vs. Mercurial, Distributed VCS: where SVN fails, git VCS
  8. 08.04 Merli Uus, Trust in Grid
  9. 15.04 Georg Singer, Advances in Vertical Search, Pelle Jakovits, Graphgrep
  10. 22.04 Anna Aljanaki, mHaskell, Oleg Batrashev, STM (Software Transactional Memory) in Haskell
  11. 29.04 -- no seminar this day --
  12. 06.05 cancelled
  13. 13.05 Vladimir Šor, HDF, Artjom Lind, jpunch - UDP Hole Punching in Java, slides
  14. 20.05 Rauno Raudpuu, Whiteboarding for F2F Computing, slides, Hannes Lehemets, Estonian information system - X-road and X-GIS, slides
  15. 27.05 Oleg Knut, F2F with LLVM, slides, Vladimir Skarupelov, An Interactive Java Profiler for the F2F Computing Framework, slides
  16. 03.06 Toomas Laasik, Jaan Neljandik, Sven Kirsimäe Practice defenses

 

Possible themes with some suggested materials to start with

  • LLVM in Depth
    • Lattner, C., & Adve, V. (n.d.). LLVM Assembly language reference manual

    • Lattner, C., & Adve, V. (2004). LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization (p. 75). IEEE Computer Society Washington, DC, USA.

    • Lattner, C., & Adve, V. (2005). The LLVM Compiler Framework and Infrastructure Tutorial. LECTURE NOTES IN COMPUTER SCIENCE, 3602, 15. 

  • Graph-pattern Search
    • Ferro, A., Giugno, R., Mongiovì, M., Pulvirenti, A., Skripin, D., & Shasha, D. (2008). GraphFind: enhancing graph searching by low support data mining techniques. BMC Bioinformatics, 9(4), S10. 

    • Giugno, R., & Shasha, D. (2002). GraphGrep: A Fast and Universal Method for Querying Graphs. In INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (Vol. 16, pp. 112-115).

    • Jiang, H., Wang, H., Yu, P. S., & Zhou, S. (2007). Gstring: A novel approach for efficient search in graph databases. In Proc. of the 23rd Int’l Conf. on Data Engineering (ICDE 2007). Istanbul: IEEE Computer Society (pp. 566-575).

    • Wang, T. (2007). Frequent Subtree Based Indexing. In Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on (pp. 5564-5567).

    • Williams, D., Huan, J., & Wang, W. (2007). Graph database indexing using structured graph decomposition. In Proc. of the 23rd IEEE International Conference on Data Engineering (ICDE), Istanbul, Turkey, April.

    • Yan, X., Yu, P. S., & Han, J. (2004). Graph indexing: a frequent structure-based approach. In Proceedings of the 2004 ACM SIGMOD international conference on Management of data (pp. 335-346). ACM New York, NY, USA.

  • Managing Trust in th Grid (chapter 10 in the book: A. Chakrabarti, Grid Computing Security, Springer 2007.)
  • TCP, UDP, Infiniband in Grid (chapters 8,9,10 in book: F Travostino, J Mambretti, G Karmous-Edwards (eds.), Grid Networks: Enabling Grids with Advanced Communication Technology , John Wiley & Sons, 2006.)
  • Network Performance Monitoring, Fault Detection, Recovery, and Restoration (chapter 13 in book: F Travostino, J Mambretti, G Karmous-Edwards (eds.), Grid Networks: Enabling Grids with Advanced Communication Technology , John Wiley & Sons, 2006.)
  • Basic Ideas of Domain Decomposition (chapter 1 in book: A. Toselli, O.Widlund, Domain Decomposition Methods - Algorithms and Theory, Springer, 2005.)
  • Basics of Finite Element Method (first chapters in book: B.Lucquin, O. Pironneau, Introduction to Scientific Computing, Wiley, 1998.)
  • Zenturio experiment management tool (chapter 4 in book: R.Prodan and T.Fahringer, Grid Computing: Experiment Management, Tool Integration, and Scientific Workflows, Springer, 2007.)
  • Zenturio Tool Integration (chapter 5 in book: R.Prodan and T.Fahringer, Grid Computing: Experiment Management, Tool Integration, and Scientific Workflows, Springer, 2007.)
  • Zenturio and Optimisation Framework (chapter 6 in book: R.Prodan and T.Fahringer, Grid Computing: Experiment Management, Tool Integration, and Scientific Workflows, Springer, 2007.)
  • Scientific Grid Workflows (chapter 7 in book: R.Prodan and T.Fahringer, Grid Computing: Experiment Management, Tool Integration, and Scientific Workflows, Springer, 2007.)

Topics in concurrent programming languages

  • Agents and STM (Software Transactional Memory) in Clojure programming language (http://clojure.org/)
  • Concurrent programming with futures and promises in Alice ML (http://www.ps.uni-sb.de/alice/papers.html)
  • Task parallelism in C++ with Intel TBB (Thread Building Blocks)
  • Data parallelism with Intel Ct (C for Throughput Computing)
  • Concurrency in E programming language (Making Distributed Secure Programming easy!)
  • Concurrency in Scala
    • Covello, C., Russell, P., & Wendell, M. (n.d.). Scala Multicast Actors: Architecture and Implementation. 

    • Haller, P., & Odersky, M. (2008). Scala Actors: Unifying thread-based and event-based programming. Theoretical Computer Science

    • Odersky, M., Altherr, P., Cremet, V., Emir, B., Maneth, S., Micheloud, S., et al. (2004). An overview of the Scala programming language. LAMP-EPFL

  • Concurrency in F# (http://en.wikipedia.org/wiki/F_Sharp_(programming_language))
  • Haskell STM (Software Transactional Memory)
    • Discolo, A., Harris, T., Marlow, S., Jones, S. P., & Singh, S. (2006). Lock Free Data Structures Using STM in Haskell. LECTURE NOTES IN COMPUTER SCIENCE, 3945, 65. 

    • Harris, T., Marlow, S., & Jones, S. P. (2005). Haskell on a shared-memory multiprocessor. In Proceedings of the 2005 ACM SIGPLAN workshop on Haskell (pp. 49-61). ACM New York, NY, USA.

    • Lam, E. S. L., & Sulzmann, M. (2007). A concurrent constraint handling rules implementation in Haskell with software transactional memory. In Proceedings of the 2007 workshop on Declarative aspects of multicore architectures (pp. 19-24). ACM Press New York, NY, USA.

    • Singh, S. (2006). Higher Order Combinators for Join Patterns using STM. In Proc. TRANSACT Workshop, OOPSLA.

  • Unified Parallel C (UPC) (http://en.wikipedia.org/wiki/Unified_Parallel_C)

 

Talks autumn 2008

 

  1. 3.09 Introductory seminar, discussions, theme proposals, overview of the research areas
  2. 10.09 Oleg Batrašev, Distributed Ozslides
  3. 24.09 Ulrich Norbisrath and Artjom Lind UDP hole punching
  4. 1.10 Janek Press, Eurographics 2008, slides
  5. 8.10 Lauri Anton UT HPC center's new cluster
  6. 15.10 Dmitri Danilov, Rendering as a Service and Pavel Vohmjanin, Data-Flow Analysis for MPI Programs
  7. 22.10 Oleg Knut, LLVM
  8. 5.11 Oleg Batrašev Data Dependency Algebras, slides
  9. 7.11 (FRI) Ulrich Norbisrath Friend-to-Friend Computing on the Grid
  10. 12.11 Ilja Livenson, Project Wonderland
  11. 14.11 (FRI) Reina Käärik Comparison of business process models
  12. 19.11 Maria Gaiduk BitTorrent and Sachin Gaur, Internet Crime, slides
  13. 21.11 (FRI, our group special event - Talgud near Pangodi, 11am-7pm)
  14. 26.11 Sander Sõnajalg Actor-based model for concurrent programming, slides, and Andrei Porõvkin, Memcached, general-purpose distributed memory caching system, slides

  15. 28.11 (FRI) Silver Holmar SIMD instructions in x86 CPUs and Kaarel Kuddu Multi-scale analysis of e-business workload
  16. 3.12 Martti Mikk, Distributed Databases, slides
  17. 5.12 (FRI)  Vladimir Šor Scientific workflows and Taverna, Jaan Neljandik Educational collaborative computer gaming
  18. 10.12 Vladimir Škarupelov, Building Profilers in Java and Richard Sassoon, Anonymity in P2P systems
  19. 12.12 (FRI) Hannes Lehemets Project proposal: neurosegmentation in (electronic) marketing, slides and Nguyen Hoang Anh Service-Oriented Architecture. An Introduction

  20. 17.12 Gererdo Iglesias Galvan, Virtua Linux and Md. Sadek Ferdous, Security and Mobile P2P

 

 Subjects, that might be interesting:

  • PS3 related subjects
  • NEUROS
  • Friend-to-Friend filesharing (the other project)
  • Programming Languages for Concurrent Programming (Erlang, Oz, Salsa)
  • Technologies for Parallel Programming (Ct, etc), see Bergen University course on Programming Models for Non-Traditional Architectures

 

 

Talks spring 2008

 

  1. 20.02 Introductory seminar, discussions
  2. 27.02 Oleg Batrašev, Bath report + ideas, DOUG overview slides
  3. 05.03 Prof. Kira Kastell, Fast handover in hybrid communication networks
  4. 12.03 Janek Press, GPU Computing
  5. 19.03 Open Day - F2F Demo - Ulrich Norbisrath / Doug Demo - Oleg Batrašev
  6. 26.03 Jüri Harju, Data Management on Grid Systems
  7. 02.04 Charles Hall, Intellectual Property and Software Development / Ulrich Norbisrath, MulliVelled - a frame for educational computer game environments (we start here at 15:15, Ulrich's talk will start at 16:00)
  8. 09.04 Vladimir Škarupelov, The PS3 Cell Processor Architecture
  9. 16.04 Vladimir Šor, Reverse Engineering
  10. 23.04 Eero Vainikko, Domain decomposition method through adaptive refinement  / Ilja Livenson, 3D Worlds from Technical Perspective
  11. 30.04 Lauri Anton, University of tartu HPC Center
  12. 07.05 Hardi Teder, TBA / other MA student (Jüri asks)
  13. 14.05 Andres Luuk, MPI on F2F / Jonas Bardino, Minimum Intrusion Grid / OpenSSH
  14. 21.05 other MA student  / other MA student (Jüri asks)
  15. 28.05 Keio Kraaner, F2F computing / Indrek Priks F2F network topology visualization

 

---------------------------------------------------------------------------------------------------------

Previous semesters
Document Actions
« September 2017 »
September
MonTueWedThuFriSatSun
123
45678910
11121314151617
18192021222324
252627282930