"Minimal, Deadlock Free and o(n) Space Memory Routing for k-ary n-cubes ..."

M. B. Hadim, Ibrahima Sakho (1995)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2009-11-09

- no documents available
- export record
  dblp key:
  - conf/pdpta/HadimS95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pdpta/HadimS95
M. B. Hadim, Ibrahima Sakho:
Minimal, Deadlock Free and o(n) Space Memory Routing for k-ary n-cubes with Wraparound Connections. PDPTA 1995: 511-520

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.