• Title/Summary/Keyword: DRRM

Search Result 3, Processing Time 0.018 seconds

Well-Regulated Pseudo-request Dual Round-Robin Matching Arbitration Algorithm for High Performance Input-Queued Switches (고성능 입력 큐스위치를 위한 통제된 슈도요구 이중화 라운드로빈 매칭 조정 알고리즘)

  • Nan, Mei-Hua;Kim, Doug-Nyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9A
    • /
    • pp.973-982
    • /
    • 2004
  • High-speed scheduling algorithms are required for high-performance input-queued switches to achieve good performance. Various Round-Robin scheduling algonthms for Virtual-Output-Queue (VOQ) switch architectures have been proposed, hke iSLIP, DRRM (Dual Round-Robin Matching). iSLIP can achieve high performance and have already been implemented in hardware. DRRM has been proved to achieve better performance and simpler than iSLIP But neither iSLIP nor DRRM can efficiently solve the problem of the Round-Robm pointers' desynchronization. In this paper, we have proposed "Well-Regulated Pseudo-request Dual Round-Robin Matching" Algorithm. It is developed from DRRM, and can always keep the pointers' desynchronization. Since our algorithm is based on the Round-Robin scheduling, it is also simple to be implemented. And simulation results also show that our proposed algonthm performs pretty well under various, traffic models.

Grant-Aware Scheduling Algorithm for VOQ-Based Input-Buffered Packet Switches

  • Han, Kyeong-Eun;Song, Jongtae;Kim, Dae-Ub;Youn, JiWook;Park, Chansung;Kim, Kwangjoon
    • ETRI Journal
    • /
    • v.40 no.3
    • /
    • pp.337-346
    • /
    • 2018
  • In this paper, we propose a grant-aware (GA) scheduling algorithm that can provide higher throughput and lower latency than a conventional dual round-robin matching (DRRM) method. In our proposed GA algorithm, when an output receives requests from different inputs, the output not only sends a grant to the selected input, but also sends a grant indicator to all the other inputs to share the grant information. This allows the inputs to skip the granted outputs in their input arbiters in the next iteration. Simulation results using OPNET show that the proposed algorithm provides a maximum 3% higher throughput with approximately 31% less queuing delay than DRRM.

Dynamic Cloud Resource Reservation Model Based on Trust

  • Qiang, Jiao-Hong;Ning, Ding-Wan;Feng, Tian-Jun;Ping, Li-Wei
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.377-395
    • /
    • 2018
  • Aiming at the problem of service reliability in resource reservation in cloud computing environments, a model of dynamic cloud resource reservation based on trust is proposed. A domain-specific cloud management architecture is designed in which resources are divided into different management domains according to the types of service for easier management. A dynamic resource reservation mechanism (DRRM) is used to test users' reservation requests and reserve resources for users. According to user preference, several resources are chosen to be candidate resources by fuzzy cluster analysis. The fuzzy evaluation method and a two-way trust evaluation mechanism are adopted to improve the availability and credibility of the model. An analysis and simulation experiments show that this model can increase the flexibility of resource reservation and improve user satisfaction.