About: Design of Arbiters and Allocators Based on Multi-Terminal BDDs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Design of Arbiters and Allocators Based on Multi-Terminal BDDs 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways, from hardware to firmware to software. The paper presents a new computer-aided technique that can produce representations of arbiters/allocators in a form of a Multi-Terminal Binary Decision Diagram (MTBDD) with close to minimum cost and width. This diagram can then serve as a prototype for a cascade of multiple-output look-up tables (LUTs) that implements the given function, or for efficient firmware implementation. The technique makes use of iterative decomposition of integer functions of Boolean variables and a variable-ordering heuristic to order variables. The LUT cascades lead directly to the pipelined design, simplify wiring and testing and can compete with the traditional FPGA design in performance and with PLA design in chip area. Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways, from hardware to firmware to software. The paper presents a new computer-aided technique that can produce representations of arbiters/allocators in a form of a Multi-Terminal Binary Decision Diagram (MTBDD) with close to minimum cost and width. This diagram can then serve as a prototype for a cascade of multiple-output look-up tables (LUTs) that implements the given function, or for efficient firmware implementation. The technique makes use of iterative decomposition of integer functions of Boolean variables and a variable-ordering heuristic to order variables. The LUT cascades lead directly to the pipelined design, simplify wiring and testing and can compete with the traditional FPGA design in performance and with PLA design in chip area. (en)
Title	Design of Arbiters and Allocators Based on Multi-Terminal BDDs Design of Arbiters and Allocators Based on Multi-Terminal BDDs (en)
skos:prefLabel	Design of Arbiters and Allocators Based on Multi-Terminal BDDs Design of Arbiters and Allocators Based on Multi-Terminal BDDs (en)
skos:notation	RIV/00216305:26230/10:PU89625!RIV12-GA0-26230___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GA102/08/1429), P(GAP103/10/1517), P(GD102/09/H042), S, Z(MSM0021630528)
http://linked.open...iv/cisloPeriodika	14
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Mikušek, Petr Dvořák, Václav
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	253524
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/10:PU89625
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Multi-Terminal BDDs, LUT cascades, iterative disjunctive decomposition, arbiter circuits, allocators. (en)
http://linked.open.../riv/klicoveSlovo	LUT cascades Multi-Terminal BDDs allocators. arbiter circuits iterative disjunctive decomposition
http://linked.open...odStatuVydavatele	AT - Rakouská republika
http://linked.open...ontrolniKodProRIV	[D747E427B108]
http://linked.open...i/riv/nazevZdroje	Journal of Universal Computer Science
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Safety and security of networked embedded system applications Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems Natural Computing on Unconventional Platforms
http://linked.open...UplatneniVysledku	2010
http://linked.open...v/svazekPeriodika	16
http://linked.open...iv/tvurceVysledku	Dvořák, Václav Mikušek, Petr
http://linked.open...n/vavai/riv/zamer	Výzkum informačních technologií z hlediska bezpečnosti
issn	0948-6968
number of pages	27 (xsd:int)
http://localhost/t...ganizacniJednotka	26230
is http://linked.open...avai/riv/vysledek of	Design of Arbiters and Allocators Based on Multi-Terminal BDDs Design of Arbiters and Allocators Based on Multi-Terminal BDDs

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software