Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On the complexity of optimal bused interconnections

From MaRDI portal
Publication:4421174
Jump to:navigation, search

DOI10.1109/12.467700zbMATH Open1048.68508OpenAlexW2054750167MaRDI QIDQ4421174FDOQ4421174


Authors: Priyalal D. Kulasinghe, Ahmed El-Amawy Edit this on Wikidata


Publication date: 1995

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.467700




Recommendations

  • The interconnection problem
  • Two algorithms for the subset interconnection design problem
  • Optimal interconnection in digital systems satisfying concurrency constraints
  • scientific article; zbMATH DE number 3976322
  • Cost-performance tradeoffs for interconnection networks


zbMATH Keywords

bus minimizationmultiple bus system


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)



Cited In (5)

  • Optimal realization of sets of interconnection functions on synchronous multiple bus systems
  • Optimal interconnection in digital systems satisfying concurrency constraints
  • Title not available (Why is that?)
  • The interconnection problem
  • Title not available (Why is that?)





This page was built for publication: On the complexity of optimal bused interconnections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421174)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4421174&oldid=18453476"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 02:48. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki