Article

A continuous time markov decision process based on-chip buffer allocation methodology

Authors:

S. Kallakuri,

N. Thepayasuwan,

A. Doboli,

E. A. FeinbergAuthors Info & Claims

GLSVLSI '05: Proceedings of the 15th ACM Great Lakes symposium on VLSI

Pages 345 - 348

https://doi.org/10.1145/1057661.1057744

Published: 17 April 2005 Publication History

Get Access

Abstract

We have presented an optimal on-chip buffer allocation and buffer insertion methodology which uses stochastic models of the architecture. This methodology uses finite buffer space and presents a method to distribute this finite space in an optimal fashion. Such a methodology is useful in managing the scarce buffer resources available on chip as compared to network based data communication which can have large buffer space. The methodology also uses Continuous Time Markov Decision Processes CTMDPs. The modeling of this problem in terms of a CTMDP framework lead to a nonlinear formulation due to usage of bridges in the bus architecture. We present a methodology to split the problem into several smaller, though linear systems and we then solve these subsystems.

References

[1]

T. Dumitras, S. Kerner, and R. Marculescu. Towards on-chip fault-tolerant communication. Proc. of ASPDAC), pages 225--232, 2003.

Digital Library

Google Scholar

[2]

E. Feinberg. Optimal control of average reward constrained continuous time finite markov decision processes. Proceedings of the IEEE Conference on Decision and Control, pages 3805--3810, 2002.

Crossref

Google Scholar

[3]

E. Feinberg and A. Shwartz. Handbook of Markov Decision Processes methods and applications. Kluwer, 2002.

Crossref

Google Scholar

[4]

K. Lahiri, A. Raghunathan, and S. Dey. Efficient exploration of the soc communication architecture design space. Proc. of ICCAD, pages 424--430, 2000.

Digital Library

Google Scholar

[5]

K. Lahiri, A. Raghunathan, and G. Lakshminarayana. Lotterybus: A new high-performance communication architecture for systems-on-chip designs. Proc. of ICCAD, pages 424--430, 2000.

Digital Library

Google Scholar

[6]

N. Thepayasuwan, V. Damle, and A. Doboli. Bus architecture synthesis for hardware-software co-design of deep submicron systems on chip. Proc. of ICCD, pages 126--133, 2003.

Digital Library

Google Scholar

[7]

Q. Qiu, Q. Wu, and M. Pedram. Dynamic power management of complex systems using generalised stochastic petri nets. Proc. of the 37th Design Automation Conference, pages 108--119, 2000.

Digital Library

Google Scholar

[8]

C. Taylor and S. Dey. Orbit: An adaptive data shaping technique for robust wireless video clip communication. Proc. of Asilomar Conference on Signals,Systems and Computers, pages 3081--3085, 2003.

Crossref

Google Scholar

Cited By

View all

Lizos K(2013)A novel methodology for modeling diversified network queuesEurocon 201310.1109/EUROCON.2013.6624991(226-233)Online publication date: Jul-2013
https://doi.org/10.1109/EUROCON.2013.6624991
Kallakuri SDoboli A(2007)Customization of arbitration policies and buffer space distribution using continuous-time Markov decision processesIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2007.89500315:2(240-245)Online publication date: 1-Feb-2007
https://dl.acm.org/doi/10.1109/TVLSI.2007.895003

Index Terms

A continuous time markov decision process based on-chip buffer allocation methodology
1. Computer systems organization
2. Hardware
  1. Very large scale integration design
    1. VLSI system specification and constraints

Recommendations

Customization of arbitration policies and buffer space distribution using continuous-time Markov decision processes

This paper presents a stochastic approach for bus arbiter design. Arbiter design includes policy design, buffer insertion, and optimal buffer sizing. The methodology uses continuous-time Markov decision processes (CTMDPs) to get optimal arbitration ...
Continuous-Time Markov Decision Processes with Discounted Rewards: The Case of Polish Spaces

This paper deals with continuous-time Markov decision processes in Polish spaces, under an expected discounted reward criterion. The transition rates of underlying continuous-time jump Markov processes are allowed to be unbounded, and the reward rates ...
Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach

This paper introduces and develops a new approach to the theory of continuous time jump Markov decision processes (CTJMDP). This approach reduces discounted CTJMDPs to discounted semi-Markov decision processes (SMDPs) and eventually to discrete-time ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

GLSVLSI '05: Proceedings of the 15th ACM Great Lakes symposium on VLSI

April 2005

518 pages

ISBN:1595930574

DOI:10.1145/1057661

General Chair:
John Lach
University of Virginia
,
Program Chairs:
Gang Qu
University of Maryland, College Park
,
Yehea Ismail
Northwestern University

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 April 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GLSVLSI05

Sponsor:

GLSVLSI05: Great Lakes Symposium on VLSI 2005

April 17 - 19, 2005

Illinois, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 312 of 1,156 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
151
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lizos K(2013)A novel methodology for modeling diversified network queuesEurocon 201310.1109/EUROCON.2013.6624991(226-233)Online publication date: Jul-2013
https://doi.org/10.1109/EUROCON.2013.6624991
Kallakuri SDoboli A(2007)Customization of arbitration policies and buffer space distribution using continuous-time Markov decision processesIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2007.89500315:2(240-245)Online publication date: 1-Feb-2007
https://dl.acm.org/doi/10.1109/TVLSI.2007.895003

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Customization of arbitration policies and buffer space distribution using continuous-time Markov decision processes

Continuous-Time Markov Decision Processes with Discounted Rewards: The Case of Polish Spaces

Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach