| Attributes | Values |
|---|
| rdf:type
| |
| Description
| - Přístup prezentovaný ve článku je založen na kódování plánu testu pomocí tzv. STEP bodů. Na základě informace o vzájemném sdílení prostředků testu jednotlivými testy (uložené ve formě TACG grafu) metoda generuje plán testu, v němž jsou přítomny všechny testy z dané množiny, nedochází ke konfliktům při aplikaci testu, jsou splněny požadavky na omezení příkonu a TAM a současně, celkový čas pro aplikaci testu se blíží minimální možné hodnotě při daných omezeních. Metoda neplánuje testy "po skupinách" ale samostatně, čímž lze dosáhnout kratších dob celkového testu. (cs)
- Approach presented in the paper is based on so-called STEPs (scheduling time-points). Using input information about test schedule constraints, information about test resource sharing conflicts stored in a TACG (test application conflict graph) and information about power dissipation, test time and TAM (test access mechanism) width of particular tests going to be scheduled, proposed test scheduling algorithm link tests to STEPs in such a way there are no resource sharing conflicts in the best-found test schedule and hopefully, test schedule constraints are met maximally at minimal time and TAM values. In our paper, so-called sessionless approach to the problem is utilized. The approach does not require tests to be partitioned into so-called test sessions for test scheduling purposes. Main advantage of the approach is that tests are not to be scheduled within test-session bounds, but they are scheduled as soon as it is possible, so significant savings in test time can be achieved. In our paper, nov
- Approach presented in the paper is based on so-called STEPs (scheduling time-points). Using input information about test schedule constraints, information about test resource sharing conflicts stored in a TACG (test application conflict graph) and information about power dissipation, test time and TAM (test access mechanism) width of particular tests going to be scheduled, proposed test scheduling algorithm link tests to STEPs in such a way there are no resource sharing conflicts in the best-found test schedule and hopefully, test schedule constraints are met maximally at minimal time and TAM values. In our paper, so-called sessionless approach to the problem is utilized. The approach does not require tests to be partitioned into so-called test sessions for test scheduling purposes. Main advantage of the approach is that tests are not to be scheduled within test-session bounds, but they are scheduled as soon as it is possible, so significant savings in test time can be achieved. In our paper, nov (en)
|
| Title
| - Novel Optimizing Approach in the Area of STEP-Based Construction of Sessionless, Power-Constrainted, TAM and Time Optimal Test Schedules
- Novel Optimizing Approach in the Area of STEP-Based Construction of Sessionless, Power-Constrainted, TAM and Time Optimal Test Schedules (en)
- Nový přístup k optimalizaci příkonu, času a prostředků plánu testu založený na STEP (cs)
|
| skos:prefLabel
| - Novel Optimizing Approach in the Area of STEP-Based Construction of Sessionless, Power-Constrainted, TAM and Time Optimal Test Schedules
- Novel Optimizing Approach in the Area of STEP-Based Construction of Sessionless, Power-Constrainted, TAM and Time Optimal Test Schedules (en)
- Nový přístup k optimalizaci příkonu, času a prostředků plánu testu založený na STEP (cs)
|
| skos:notation
| - RIV/00216305:26230/06:PU66865!RIV07-GA0-26230___
|
| http://linked.open.../vavai/riv/strany
| |
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| |
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/06:PU66865
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - test scheduling, power constraint, test access mechanism, sessionless, test application graph (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...v/mistoKonaniAkce
| |
| http://linked.open...i/riv/mistoVydani
| |
| http://linked.open...i/riv/nazevZdroje
| - Proceedings of the 13th IEEE International Symposium and Workshop on the Engineering of Computer-Based Systems (ECBS)
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...vavai/riv/projekt
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...iv/tvurceVysledku
| - Strnadel, Josef
- Dhali, Arghya
|
| http://linked.open...vavai/riv/typAkce
| |
| http://linked.open.../riv/zahajeniAkce
| |
| number of pages
| |
| http://purl.org/ne...btex#hasPublisher
| |
| https://schema.org/isbn
| |
| http://localhost/t...ganizacniJednotka
| |
| is http://linked.open...avai/riv/vysledek
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)