A Deadlock-free Fully-Adaptive Minimal Routing Algorithm in Recursive Circulant Multicomputers

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 427
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorPark, J.H.-
dc.contributor.authorYoon, Hyunsoo-
dc.date.accessioned2013-03-14T06:23:30Z-
dc.date.available2013-03-14T06:23:30Z-
dc.date.created2012-02-06-
dc.date.issued1993-
dc.identifier.citationProceedings of Parallel Processing System, v., no., pp.158 - 170-
dc.identifier.urihttp://hdl.handle.net/10203/106104-
dc.languageKOR-
dc.titleA Deadlock-free Fully-Adaptive Minimal Routing Algorithm in Recursive Circulant Multicomputers-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage158-
dc.citation.endingpage170-
dc.citation.publicationnameProceedings of Parallel Processing System-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthorYoon, Hyunsoo-
dc.contributor.nonIdAuthorPark, J.H.-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0