Full metadata record

DC FieldValueLanguage
dc.contributor.author박성주-
dc.date.accessioned2020-11-26T01:16:07Z-
dc.date.available2020-11-26T01:16:07Z-
dc.date.issued2003-06-
dc.identifier.citationLECTURE NOTES IN COMPUTER SCIENCE, v. 2713, page. 272-281en_US
dc.identifier.isbn3-540-40456-2-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://link.springer.com/chapter/10.1007/3-540-45036-X_28-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/155923-
dc.description.abstractInfiniBand Architecture(IBA) adopts a mechanism of Virtual Lanes(VL) to support various QoS, improve link utilization and avoid deadlock. IBA packets are placed in a buffer corresponding to each VL and are scheduled by a VL arbiter. Since the number of the packets through each VL may be different, the throughput can be improved by allocating buffers according to the packet characteristics. In this paper, a new buffer allocation scheme using VL arbitration table is proposed and the superiority of the network performance is shown through the simulation results.en_US
dc.language.isoen_USen_US
dc.publisherSPRINGER-VERLAG BERLINen_US
dc.subjectBuffer Sizeen_US
dc.subjectVery Large Scale Integrationen_US
dc.subjectBuffer Spaceen_US
dc.subjectBuffer Allocationen_US
dc.subjectRemote Direct Memory Accessen_US
dc.titleAn Efficient Buffer Allocation Technique for Virtual Lanes in InfiniBand Networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/3-540-45036-X_28-
dc.relation.journalLECTURE NOTES IN COMPUTER SCIENCE-
dc.contributor.googleauthorYi, HyunBean-
dc.contributor.googleauthorPark, SungJu-
dc.contributor.googleauthorKim, Misook-
dc.contributor.googleauthorJeon, Kiman-
dc.relation.code2007206327-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF COMPUTING[E]-
dc.sector.departmentDIVISION OF COMPUTER SCIENCE-
dc.identifier.pidpaksj-
Appears in Collections:
ETC[S] > 연구정보
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE