[go: up one dir, main page]

Takagi, 1994 - Google Patents

Queueing analysis of polling models: progress in 1990–1993

Takagi, 1994

View PDF
Document ID
8464662007102617073
Author
Takagi H
Publication year
Publication venue
Frontiers in Queueing: Models, Methods and Problems

External Links

Snippet

Polling models generally refer to systems of multiple queues served by nondedicated servers with rules that allocate the servers to the queues. Started with studies of basic models, which consist of separate queues with independent Poisson arrivals served by a …
Continue reading at infoshako.sk.tsukuba.ac.jp (PDF) (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/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/54—Interprogramme communication; Intertask communication
    • G06F9/546—Message passing systems or structures, e.g. queues
    • 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/5601—Transfer mode dependent, e.g. ATM
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0631—Resource planning, allocation or scheduling for a business operation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details

Similar Documents

Publication Publication Date Title
Takagi Queueing analysis of polling models: progress in 1990-1994
Konheim et al. Descendant set: an efficient approach for the analysis of polling systems
Takagi Analysis and application of polling models
Levy et al. Polling systems: applications, modeling, and optimization
Chow Models for dynamic load balancing in a heterogeneous multiple processor system
Boxma et al. Waiting times in discrete-time cyclic-service systems
Kelly et al. Stochastic networks
Boxma Workloads and waiting times in single-server systems with multiple customer classes
Browne et al. Dynamic priority rules for cyclic-type queues
Takagi Queueing analysis of polling models: progress in 1990–1993
Boxma et al. A pseudoconservation law for service systems with a polling table
Potter et al. Analysis of a discrete multipriority queueing system involving a central shared processor serving many local queues
Olsen et al. Polling systems with periodic server routeing in heavy traffic: distribution of the delay
Sztrik Finite-source queueing systems and their applications
Altiok et al. Single-stage, multi-product production/inventory systems with backorders
Choudhury et al. A batch arrival retrial queue with two phases of service and Bernoulli vacation schedule
Squillante et al. Generalized parallel-server fork-join queues with dynamic task scheduling
Bertoli et al. An overview of the jmt queueing network simulator
Nam Dynamic scheduling for a flexible processing network
Lee et al. Exact analysis of asymmetric random polling systems with single buffers and correlated input process
Xu et al. On competitive analysis for polling systems
Murata et al. Performance analysis of token ring networks with a reservation priority discipline
Akyildiz et al. International Seminar on Modelling and Performance Evaluation Methodology
Hong et al. Analysis of transmission delay for a structured-priority packet-switching system
Fendick et al. A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline