Scheduling of Transactions under Resource Constraint Based on Extended Preemptive Time Petri Nets for SoC System-Level Test-Case Generation

Author

Yu, Jinshan ; Li, Tun ; Tan, Qingping

Author_Institution

Nat. Univ. of Defense Technol., Changsha

fYear

2007

fDate

22-28 April 2007

Firstpage

20

Lastpage

20

Abstract

The transaction-based verification method and the effective scheduling of transactions have a great potential for SoC functional verification. Petri nets have proven to be a promising technique for solving scheduling problem. This paper aims at presenting a extended preemptive time Petri net (EPTPN) based approach to the scheduling of transactions under TAM resource constraint generated by a transaction test-case generator. Firstly, the short term of ´scheduling of transactions problem´ is formulated by means of an EPTPN. Secondly, transactions scheduling algorithm based on EPTPN is given. Finally, cases are studied to show the method effective.

Keywords

Petri nets; integrated circuit testing; scheduling; system-on-chip; SoC system-level test-case generation; extended preemptive time Petri nets; resource constraint; transaction scheduling; transaction-based verification method; Computer bugs; Computer science; Design engineering; Job shop scheduling; Petri nets; Processor scheduling; Scheduling algorithm; Signal processing; System testing; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, 2007. ICONS '07. Second International Conference on

Conference_Location

Martinique

Print_ISBN

0-7695-2807-4

Electronic_ISBN

0-7695-2807-4

Type

conf

DOI

10.1109/ICONS.2007.45

Filename

4196322