Okruh Počítačové systémy a sítě

Computer Systems and Networks



Energy efficient algorithms and systems

This topic deals with a novel area of algorithms and systems that are designed to balance energy consumption with the actual achievable performance. The design of energy efficient systems is considered as a key prerequisite to the construction of super-large scale computer systems (the so called exa-scale and beyond supercomputers). The energy efficient algorithms, while being a part of the planning for this super-large scale systems do have even more immediate use in mobile devices (the energy consumption may be more important aspect than the speed) and also in contemporary computer centers where energy bill is becoming a limiting factor for their grows. Student will get deeper understanding of the motivations and the solution currently employed in the design of both the energy efficient algorithms and systems.

Recommended literature:

As there are currently no books covering this area, student is expected to use the journal and conference papers and related material to get the proper perspective and knowledge of the area. The primary bibliographical sources are:
Papers and presentations (co-)authored by Susanne Albers, e.g. Energy-Efficient Algorithms, Communications of the ACM, Vol. 53(5), Pages 86–96, 2010, related slides
On multi-processor speed scaling with migration, Journal of Computer and System Sciences, Vol. 81(7), November 2015, Pages 1194–1209
Papers from the Performance and Algorithms group at Berkley Lab and specifically the EDGAR project there on Energy Efficient Data and Graph algorithms
Further reading is also
Donofrie et al: Energy efficient computing for extreme-scale science, Computer, November 2009, pages 62–71
Dreslinski et al: Near-Threshold Computing: Reclaiming Moore’s Law Through Energy Efficient Integrated Circuits, Proceedings of the IEEE, Vol. 98(2), pages 253–266, 2010


Complex networks, analysis and applications

Complex networks are graphs with complex (non-trivial) topological features used to model and empirically study real systems like computer, technological, or social networks, brain networks. Student will get deeper understanding of fundamentals and basic principles of complex networks. He will be able to describe fundamentals of their usage for different applications. He will be able to present and discuss at least two applications from different areas and compare advantages and disadvantages of their analysis through complex networks approach. Examples of such applications are Internet modeling by complex graphs and Exponential Random Graph Models (ERGMs), methods and the social selection models.

Recommended literature:

  • van Steen, M. (2010). Graph theory and Complex Networks (Chapters 6 - 8)
  • Lusher, D., Koskinen, J., & Robins, G. (2012). Exponential random graph models for social networks: Theory, methods, and applications. (Chapters 2-6, 8, 13)

Examiner:

Eva Hladká, Luděk Matyska


Peer to peer networks, ad hoc and p2p networks relationship

Student will get deeper understanding of fundamentals and basic construction principles of peer-to-peer (p2p) networks. He will be able to properly distinguish between structured and unstructured p2p networks, will be able to describe and discuss basic communication algorithms. he will be able to present and discuss search algorithms in structured and unstructured p2p networks, will understand the differences and will be able to compare advantages and disadvantages of these algorithms in different kinds of networks. The second part are basic construction principles of ad hoc networks (e.g. like those to be used in Internet of things) with a special focus on p2p networks over ad hoc ones. He will understand the limits of p2p over ad hoc networks and will be able to discuss the how the principles of ad hoc and p2p networks could interact.

Recommended literature:

P2P networks, structured and unstructured
  • BUFORD, J., H. YU a E.K. LUA. /P2P Networking and Applications/. Elsevier Science, 2009. ISBN 9780080921198. Available also online + Chapters 3, 4, 5
  • SHEN, X., H. YU, J. BUFORD a M. AKON. /Handbook of Peer-to-Peer Networking/. Springer US, 2010. ISBN 9780387097510. available also online + Part II, Part III
  • STEINMETZ, R. a K. WEHRLE. /Peer-to-Peer Systems and Applications/. Springer Berlin Heidelberg, 2005. ISBN 9783540320470. Available also online + Part II, Part III
P2P over ad hoc networks
  • SHEN, X., H. YU, J. BUFORD a M. AKON. /Handbook of Peer-to-Peer Networking/. Springer US, 2010. ISBN 9780387097510. Available also online + Part IX
  • STEINMETZ, R. a K. WEHRLE. /Peer-to-Peer Systems and Applications/. Springer Berlin Heidelberg, 2005. ISBN 9783540320470. Available also online + Part VIII
Self-Organization
  • STEINMETZ, R. a K. WEHRLE. /Peer-to-Peer Systems and Applications/. Springer Berlin Heidelberg, 2005. ISBN 9783540320470. Available also online + Part V

Examiner:

Eva Hladká, Luděk Matyska