Home Page

Zdeněk Hanzálek - přednášky/lectures on scheduling and distributed systems

Téma	Topic	Další literatura	Předměty Ing.		English courses		Rigorózní PhD.
Průmyslové sítě - úvod	Fieldbus Systems - Introduction	fieldbus	35DRS		E35DRS		SDU
CAN	CAN	CAN-phy CAN-link can-cia	35DRS		E35DRS		SDU
LonWorks	LonWorks	Lon-intro LonTalk echelon lonmark	35DRS		E35DRS		SDU
Profibus	Profibus	profibus_sdruzeni profibus_international	35DRS		E35DRS		SDU
Paralelní počítače	Parallel computers		35DRS		E35DRS		SDU
Petriho sítě text Petriho sítě přednášky	Petri Nets	Murata1989 Desel2000 David2005 petrinet_world	35DRS		E35DRS		SDU
Petriho sítě a čas	Petri Nets and time	Barthomieu1991 Magnin2005 berthomieu	35DRS				SDU
Petriho sítě - supervizor	Petri Nets - Supervisor	Yamalidou1996 antsaklis	35DRS				SDU
Konvexní množiny	Convex sets	Boyd2003 Fukuda2000 optimization	35DRS				SDU	ROZ
Rozvrhování - úvod	Scheduling - Introduction	Blazewicz1996		35RDU		E35RDU		ROZ
Jeden procesor	Single processor	Blazewicz1996		35RDU		E35RDU		ROZ
Paralelní procesory	Parallel processors	Blazewicz1996		35RDU		E35RDU		ROZ
Dedikované procesory	Dedicated processors	Blazewicz1996		35RDU		E35RDU		ROZ
On-line rozvrhování	On-line scheduling	Butazzo1997 Liu2000 Burns2001		35RDU		E35RDU		ROZ
Uppaal	Uppaal	uppaal		35RDU		E35RDU	SDU
Matematika	Mathematics	Rektorys2000 mathworld math-atlas crc-math wikipedia					SDU	ROZ
Teorie grafů	Graph theory	Diestel2000 Demel2002					SDU	ROZ
Spojité Petriho sítě Hybridní Petriho sítě	Continuous Petri Nets Hybrid Petri Nets	David1998 David2001 David2005					SDU
Automaty, temporální logika a ověřování vlastností modelu.	Automata, Linear-time Temporal Logic and model checking	Jancar2002 LTL					SDU
Časované automaty a ověřování vlastností modelu.	Timed automata and model checking	Bengtsson2004					SDU
Výpočetní složitost (viz Rozvrhování - úvod)	Computational Complexity	Cook1971 Papadimitriu1994 Jancar2002a wikipedia						ROZ
ILP	ILP	Vanderbei2001						ROZ
SAT	SAT	Cook1971 Memik2002 Crama2005						ROZ
Analýza doby odezvy v operačních systémech reálného času.	Response time analysis	Burns2001 (28-35)						ROZ
Cyklické rozvrhování	Cyclic scheduling	Hanen1994 Ito1995						ROZ

Literatura

Datasheets:

CAN physical layer

CAN link layer

Introduction to the LonWorks system

Lontalk Protocol Specification

Linear-time Temporal Logic

Web pages:

http://www.fieldbus.cz

http://www.can-cia.org/

http://www.echelon.com

http://www.lonmark.org

http://www.profibus.cz

http://www.profibus.com

http://www.informatik.uni-hamburg.de/TGI/PetriNets/

http://www.optimization-online.org/

http://www.uppaal.com/

http://mathworld.wolfram.com/

http://www.math-atlas.org/

http://en.wikipedia.org/wiki/Main_Page

http://hades.ph.tn.tudelft.nl/Internal/PHServices/Documentation/MathWorld/math/math.htm

Personal web pages:

http://www.nd.edu/~pantsakl/

http://www.laas.fr/~bernard/

Available articles and books in English:

Tadao Murata. Petri nets: properties, analysis, and applications. Proceedings of the IEEE, 77(4):541-580, April 1989.

J. Desel, G. Balbo, K. Jensen, W. Reisig, G. Rozenberg, and M. Silva: Introductory Tutorial on Petri Nets, 21st International Conference on Application and Theory of Petri Nets, Aarhus, Denmark, June 26-30, 2000.

B. Barthomieu, M. Diaz, Modeling and verification of time dependent systems using time petri nets, IEEE TSE-Trans. on Software Eng. SE-17, March (1991) 259-273.

K. Yamalidou, J. Moody, M. D. Lemmon and P. J. Antsaklis, Feedback Control of Petri Nets Based on Place Invariants, Automatica, Vol 32, No 1, pp 15-28, January 1996.

S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge Univ. Press, 2003.

K. Fukuda, Frequently Asked Questions in Polyhedral Computations, Swiss Federal Institute of Technology, Lausanne and Zurich, Switzerland, 2000, Technical Report.

Reinhard Diestel. Graph Theory. Electronic Edition 2000. c Springer-Verlag, New York, (1997, 2000)

H. Alla, R. David, A modeling and analysis tool for discrete events systems: continuous Petri Net,
Performance Evaluation, Vol. 33, No. 3, pp. 175-199, 1998.

R. David, H. Alla, On hybrid Petri Nets, Discrete Event Dynamic Systems: Theory and Applications, Vol. 11, Numbers 1/2, pp. 9-40, January-April 2001.

Morgan Magnin, Didier Lime, and Olivier (H.) Roux. An efficient method for computing exact state space of Petri nets with stopwatches. In third International Workshop on Software Model-Checking (SoftMC'05), Electronic Notes in Theoretical Computer Science, July 2005. ... slides

Johan Bengtsson and Wang Yi. Timed Automata: Semantics, Algorithms and Tools, In Lecture Notes on Concurrency and Petri Nets. W. Reisig and G. Rozenberg (eds.), LNCS 3098, Springer-Verlag, 2004.

Seda Ogrenci Memik and Farzan Fallah, Accelerated SAT-based Scheduling of Control/Data Flow Graphs, IEEE International Conference on Computer Design (ICCD), September 2002, Freiburg, Germany.

S. Cook, The Complexity of Theorem Proving Procedures, Proceedings of Third Annual ACM Symposium on Theory of Computing, pp 151-158, May 1971.

Kazuhito Ito and Keshab K. Parhi, Determining the Minimum Iteration Period of an Algorithm, Journal of VLSI Signal Processing, 11, 229–244, 1995 Kluwer Academic Publishers.

Robert J. Vanderbei, Linear Programming: Foundations and Extensions, Princeton University, 2001.

Yves Crama and Peter L. Hammer, Boolean Functions - Theory, Algorithms and Applications, University of Liège and Rutgers University, 2005.

C. Hanen and A. Munier, Cyclic scheduling on parallel processors: an overview, 1994.

Alan Burns and Andy Wellings, Real-Time Systems and Programming Languages (Third Edition), Addison Wesley Longmain, 2001.

Available articles and books in Czech:

Petr Jančar, Teorie jazyků a automatů, VŠB Ostrava, 2002.

Petr Jančar, Vyčíslitelnost a složitost, VŠB Ostrava, 2002.

Books in English:

Christos Papadimitriu: Computational Complexity. Addison Wesley 1994.

Blazewicz, J., Ecker, K., Schmidt, G., Weglarz, J.: Scheduling in Computer and Manufacturing Systems, Springer- Verlag, Berlin (1993,1996).

Butazzo, G.C.: Hard Real-Time Computing Systems - Periodic Scheduling Algorithms and Applications, Kluwer, (1997).

Liu, J.W.S.: Real-Time Systems, Prentice Hall, (2000).

R. David and H. Alla, Discrete, Continuous, and Hybrid Petri Nets, Springer 2005.

Books in Czech:

Jiří Demel, Grafy a jejich aplikace, Academia, 2002.

Rektorys Karel, Přehled užité matematiky I a II, Prometheus 2000.

Advice for and Expectations from New Students (Copy of CHRISTOS KOZYRAKIS page)

The following is a list of advice and/or expectations from the graduate students I work with. Several of them are directly from David Patterson's "How to Have a Bad Career in Industry or Academia".

Success is determined by you: Your advisor can only set up an opportunity for research. What you do with it is primarily up to you. Don't expect your advisor to tell you what to do from the very beginning till your very end. After a certain point, the ideas, the implementations, the papers, and the success will be mostly because of your talent and hard work.
Learn on your own: Computer systems is a huge, fast moving field. Don't expect your advisor to know everything. Read and learn on your own. Attend seminars and conferences, talk with your colleagues (students or professors), read papers, follow references. Once you know a few new things about a topic, teach your advisor about it...
Show initiative: There are many quite students who can execute a task once they are told to. The students that really excel are those who are active participants in a research group. Those who ask questions, offer replies, suggest new problems to work on, come up with innovative new solutions to problems. So, don't sit back and wait to be told what to do. Be active. Every now and then you may ask a "stupid" question or suggest a "bad" idea. This is only natural... And don't get intimidated by the intelligence of the faculty or other students.
Work in group project: Computer systems research is almost always a group activity. There are few grant research ideas that can be handled by a single student these days. Many students have a hard time working in groups. The don't like the idea sharing their new ideas or mistakes with others and have a general insecurity about who gets credit for what. Make your research group an asset instead of a problem. If you are a good team player you can benefit greatly from a group project. First, you will learn much more than your immediate research (expert in one topic and knowledgeable in many other). Second, you will probably end up with many more papers that if you worked on your own. You will have access to all the tools & technology developed in the group (less time spent implementing basic tools). In addition, the influence of the other team members will become a source of inspiration for you. Finally, you will make some good friends that will be very useful in the future, no matter what you do next...
Be broad: Several student rush to overspecialize on a niche research domain. While this may seem the fastest way to get to results, you should try to resist the temptation. The importance of your research topic and the impact of your thesis will be much higher if you have a broad understanding of computer systems technology. Don't just take architecture classes. Take classes in compilers, operating systems, networking, and other systems area. Don't just attend architecture seminars or talk just to students and faculty specializing in architecture.
Be organized: Organize your work to achieve short-term (daily, weekly) and long-term (monthly yearly) goals. Your time is a very valuable commodity. Use it in a smart way. In addition, keep good notes of the ideas, issues, and bugs you run into. This is the best way to avoid duplicating work and to have a head start on all papers, reports, etc.
Be honest about your work: The worst thing you can do is to ruin your reputation as a student or as a researcher. Be honest when you promise to deliver something (result, paper, etc). Be honest when you present your research accomplishments. It is easy to be dishonest with both and get away with it in the short term. However, your advisor and colleagues will eventually catch up with you and, once your reputation is damaged, it is very difficult to recover.