메뉴 건너뛰기




Volumn , Issue , 2004, Pages 111-115

Weighted random matching: A simple scheduling algorithm for achieving 100% throughput

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; ITERATIVE METHODS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; RANDOM PROCESSES; SCHEDULING; SPEED; TELECOMMUNICATION TRAFFIC; THROUGHPUT;

EID: 2942585210     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (14)
  • 6
    • 0022497438 scopus 로고
    • An improved parallel algorithm for maximal matching
    • A. Israeli and Y. Shiloach. An improved parallel algorithm for maximal matching. In Information Processing Letters, volume 22, pages 57-60, 1986.
    • (1986) Information Processing Letters , vol.22 , pp. 57-60
    • Israeli, A.1    Shiloach, Y.2
  • 8
    • 0033879306 scopus 로고    scopus 로고
    • On the stability of input-buffer cell switches with speed-up
    • M. A. Marsan, E. Leonardi, M. Mellia, and F. Neri. On the stability of input-buffer cell switches with speed-up. In IEEE Infocom, pages 1604-1613, 2000.
    • (2000) IEEE Infocom , pp. 1604-1613
    • Marsan, M.A.1    Leonardi, E.2    Mellia, M.3    Neri, F.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.