[go: up one dir, main page]

Jiang et al., 2016 - Google Patents

Adia: Achieving high link utilization with coflow-aware scheduling in data center networks

Jiang et al., 2016

Document ID
13489391316520268644
Author
Jiang J
Ma S
Li B
Li B
Publication year
Publication venue
IEEE Transactions on Cloud Computing

External Links

Snippet

Link utilization has received extensive attention since data centers become the most pervasive platform for data-parallel applications. A specific job of such applications involves communication among multiple machines. The recently proposed coflow abstraction depicts …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5693—Queue scheduling in packet switching networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5083—Techniques for rebalancing the load in a distributed system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H04L47/12—Congestion avoidance or recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H04L47/24—Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
    • H04L47/2441—Flow classification
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding through a switch fabric
    • H04L49/253—Connections establishment or release between ports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network

Similar Documents

Publication Publication Date Title
US11036556B1 (en) Concurrent program execution optimization
Ghorbani et al. Micro load balancing in data centers with DRILL
Wang et al. A survey on data center networking for cloud computing
Huang et al. Sunflow: Efficient optical circuit scheduling for coflows
Wang et al. PRSFC-IoT: A performance and resource aware orchestration system of service function chaining for Internet of Things
Guo et al. Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach
US20050259574A1 (en) Method and apparatus for implementing scheduling algorithms in a network element
Shen et al. VirtCo: joint coflow scheduling and virtual machine placement in cloud data centers
Liu et al. Enabling work-conserving bandwidth guarantees for multi-tenant datacenters via dynamic tenant-queue binding
Liu et al. A port-based forwarding load-balancing scheduling approach for cloud datacenter networks
Aljoby et al. On SDN-enabled online and dynamic bandwidth allocation for stream analytics
Wu et al. MCCS: A Service-based Approach to Collective Communication for Multi-Tenant Cloud
Ma et al. Chronos: Meeting coflow deadlines in data center networks
Jiang et al. Adia: Achieving high link utilization with coflow-aware scheduling in data center networks
Wang et al. Network-aware placement of virtual machine ensembles using effective bandwidth estimation
US20070268825A1 (en) Fine-grain fairness in a hierarchical switched system
Ma et al. Maximizing container-based network isolation in parallel computing clusters
Li et al. CoMan: Managing bandwidth across computing frameworks in multiplexed datacenters
Jiang et al. Tailor: Trimming coflow completion times in datacenter networks
Liang et al. BAShuffler: Maximizing network bandwidth utilization in the shuffle of YARN
Yu et al. Towards predictable performance via two-layer bandwidth allocation in cloud datacenter
Wang et al. SARS: Towards minimizing average Coflow Completion Time in MapReduce systems
Liu et al. MSDQ: Multi-Scheduling Dual-Queues coflow scheduling without prior knowledge
Watashiba et al. An architectural design of a job management system leveraging software defined network
Li et al. Fair and near-optimal coflow scheduling without prior knowledge of coflow size.