About: I-path Scheduling Algorithm for RT Level Circuits     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • V příspěvku je představen nový přístup k plánování i-cest v obvodu na úrovni meziregistrových přenosů. Navržený algoritmus umožňuje plánovat i-cesty nejen v rámci struktury obvodu, ale také v čase. Na začátku práce je představen navržený formální model, který je použit pro modelování datové cesty obvodu. Tento model je pak využit pro formální definici i-cesty. Hlavní část příspěvku je věnována představení metody pro plánování i-cest. Metoda umožňuje monitorovat využití prvků obvodu v čase a na základě toho detekovat potenciální konflikty mezi i-cestami. (cs)
  • In the paper, a new approach for scheduling i-paths in Register Transfer (RT) level circuits is presented. The proposed algorithm is able to schedule i-paths not only in circuit structure, but also in time. At the beginning, the formal model for modelling data-path of structurally described RT level circuits is defined. This model is then used to define the i-path concept. The main part of the paper is devoted to introduce a method for i-path scheduling. The method is able to monitor component utilization in time and it is able to detect and solve conflicts between i-paths.
  • In the paper, a new approach for scheduling i-paths in Register Transfer (RT) level circuits is presented. The proposed algorithm is able to schedule i-paths not only in circuit structure, but also in time. At the beginning, the formal model for modelling data-path of structurally described RT level circuits is defined. This model is then used to define the i-path concept. The main part of the paper is devoted to introduce a method for i-path scheduling. The method is able to monitor component utilization in time and it is able to detect and solve conflicts between i-paths. (en)
Title
  • I-path Scheduling Algorithm for RT Level Circuits
  • I-path Scheduling Algorithm for RT Level Circuits (en)
  • Algoritmus plánování I-cest v obvodu na úrovni RT (cs)
skos:prefLabel
  • I-path Scheduling Algorithm for RT Level Circuits
  • I-path Scheduling Algorithm for RT Level Circuits (en)
  • Algoritmus plánování I-cest v obvodu na úrovni RT (cs)
skos:notation
  • RIV/00216305:26230/06:PU66993!RIV07-GA0-26230___
http://linked.open.../vavai/riv/strany
  • 174-181
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GD102/05/H050)
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
  • 480428
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/06:PU66993
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • i-path, scheduling, backtracking (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [74156C948780]
http://linked.open...v/mistoKonaniAkce
  • Mikulov
http://linked.open...i/riv/mistoVydani
  • Mikulov
http://linked.open...i/riv/nazevZdroje
  • MEMICS 2006 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
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
  • Kotásek, Zdeněk
  • Pečenka, Tomáš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Neuveden
https://schema.org/isbn
  • 80-214-3287-X
http://localhost/t...ganizacniJednotka
  • 26230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software