Skip to main content

Part of the book series: Embedded Systems ((EMSY,volume 24))

  • 1047 Accesses

Abstract

In this chapter, we discuss the algorithms that the resource manager must implement to try to find a mapping for a transceiver instance (a job) at runtime, and decide whether the job can be executed or not.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bibliography

  1. S. K. Baruah and S. Funk. Task assignment in heterogenous multiprocessor platforms. Technical report, University of North Carolina, 2003.

    Google Scholar 

  2. J. Beck and D. Siewiorek. Modeling multicomputer task allocation as a vector packing problem. In Proceedings of the 9th international symposium on System synthesis, ISSS ’96, pages 115–, Washington, DC, USA, 1996. IEEE Computer Society.

    Google Scholar 

  3. E. G. Coffman, Jr., E. G. Coffman, D. S. Johnson, D. S. Johnson, L. A. Mcgeoch, L. A. Mcgeoch, R. R. Weber, and R. R. Weber. Bin packing with discrete item sizes part ii: Average-case behavior of ffd and bfd. In preparation, 13:384–402, 1997.

    Google Scholar 

  4. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.

    Google Scholar 

  5. K. Goossens, J. Dielissen, J. van Meerbergen, P. Poplavko, A. Rădulescu, E. Rijpkema, E. Waterlander, and P. Wielage. Guaranteeing the quality of services in networks on chip, pages 61–82. Kluwer Academic Publishers, Hingham, MA, USA, 2003.

    Google Scholar 

  6. K. Goossens, P. Wielage, A. Peeters, and J. Van Meerbergen. Networks on silicon: Combining best-effort and guaranteed services. In Proceedings of the conference on Design, automation and test in Europe, DATE ’02, pages 423–, Washington, DC, USA, 2002. IEEE Computer Society.

    Google Scholar 

  7. A. Hansson, K. Goossens, and A. Radulescu. A unified approach to constraint mapping and routing on network-on-chip architectures. In Int’l Symposium on System Synthesis (ISSS), pages 75–80, 2005.

    Google Scholar 

  8. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 1970.

    Google Scholar 

  9. S. G. Kolliopoulos and C. Stein. Approximating disjoint-path problems using greedy algorithms and packing integer programs. In Lecture Notes in Computer Science, volume 1412/1998, pages 153–168. Springer-Verlag, 1998.

    Google Scholar 

  10. B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms. Springer-Verlag Berlin Heidelberg, 2002.

    Google Scholar 

  11. L. Kou and G. Markowski. Multidimensional bin packing algortihms. IBM Journal of Research and Development, 22(2), 1977.

    Google Scholar 

  12. J. Liebeherr, A. Burchard, Y. Oh, and S. H. Son. New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans. Comput., 44:1429–1442, December 1995.

    Article  MathSciNet  MATH  Google Scholar 

  13. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 20:46–61, January 1973.

    Article  MathSciNet  MATH  Google Scholar 

  14. T. Marescaux, B. Bricke, P. Debacker, V. Nollet, and H. Corporaal. Dynamic time-slot allocation for qos enabled networks on chip. In ESTImedia, pages 47–52, 2005.

    Google Scholar 

  15. G. Martin and H. Chang. Winning the SoC Revolution. Kluwer Academic Publishers, 2003.

    Google Scholar 

  16. J. Mol. Resource allocation for streaming applications in multiprocessors. Technical report, Delft University of Technology, 2004.

    Google Scholar 

  17. S. Sriram and S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker Inc., 2000.

    Google Scholar 

  18. D. tzen Peng, K. G. Shin, and T. F. Abdelzaher. Assignment and scheduling communicating periodic tasks in distributed real-time systems. IEEE Transactions on Software Engineering, 23:745–758, 1997.

    Google Scholar 

  19. O. Zapata and P. Mejia-Alvarez. Analysis of real-time multiprocessors scheduling algorithms. In Proceedings of the Real-Time Systems Symposium (RTSS), 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Moreira, O., Corporaal, H. (2014). Resource Manager. In: Scheduling Real-Time Streaming Applications onto an Embedded Multiprocessor. Embedded Systems, vol 24. Springer, Cham. https://doi.org/10.1007/978-3-319-01246-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01246-9_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01245-2

  • Online ISBN: 978-3-319-01246-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics