Symbolic Schedulability Analysis of Task Sets with Arbitrary Deadlines

Mitchell L. Neilsen. Symbolic Schedulability Analysis of Task Sets with Arbitrary Deadlines. In Hamid R. Arabnia, Steve C. Chiu, George A. Gravvanis, Minoru Ito, Kazuki Joe, Hiroaki Nishikawa, Ashu M. G. Solo, editors, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010, Las Vegas, Nevada, USA, July 12-15, 2010, 2 Volumes. pages 284-290, CSREA Press, 2010.

@inproceedings{Neilsen10,
  title = {Symbolic Schedulability Analysis of Task Sets with Arbitrary Deadlines},
  author = {Mitchell L. Neilsen},
  year = {2010},
  tags = {analysis},
  researchr = {https://researchr.org/publication/Neilsen10},
  cites = {0},
  citedby = {0},
  pages = {284-290},
  booktitle = {Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010, Las Vegas, Nevada, USA, July 12-15, 2010, 2 Volumes},
  editor = {Hamid R. Arabnia and Steve C. Chiu and George A. Gravvanis and Minoru Ito and Kazuki Joe and Hiroaki Nishikawa and Ashu M. G. Solo},
  publisher = {CSREA Press},
  isbn = {1-60132-158-9},
}