Skip to content
Free planNo credit card requiredStart writing

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Queue”

Queue, queue, queue for care

Roger Collier · Canadian Medical Association Journal · 2012

If the experiences of readers of medical journalism were to mirror those of patients in Canada’s health care system, you might have to wait 6–12 months before you could read this article. Of course, if you just want something to read in the waiting room when your appointment eventually rolls

Cited by 0Open access

Queue

Gillian Fuller · 2015

Cited by 0

Queue

National Cancer Institute · Definitions · 2020

Cited by 0Open access

Queue

Jianfeng Ren, Andric Li · 2025

Cited by 0

queue

Zhili Zhao · 2008

Cited by 0

queue

Djalil Chafai, Hal Id Hal · 2005

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. cc sd

Cited by 0

@queue

Bulletin of Miscellaneous Information (Royal Gardens Kew)

Cited by 0

Queue

Coilly, Nathalie · SPIRE - Sciences Po Institutional REpository · 2011

National audience

Cited by 0

Queue

Coilly, Nathalie · SPIRE - Sciences Po Institutional REpository · 2011

Cited by 0

Queue

Simone Muench, Jackie K. White · Project Muse (Johns Hopkins University) · 2020

Cited by 0

The queue-read queue-write PRAM model: . . .

Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran · 1996

Thispaperintroducesthe queue-read, queue-write(qrqw)parallelrandomaccess machine(pram)model,whichpermitsconcurrentreadingandwritingtosharedmemorylocations,butatacostproportionaltothenumberofreaders/writerstoanyone memorylocationinagivenstep.Priortothisworktherewerenoformalcomplexity modelsthataccountedforthecontentiontomemorylocations,despiteitslargeimpact ontheperformanceofparallelprograms.The qrqw prammodelreectsthecontention propertiesofmostcommerciallyavailableparallelmachinesmoreaccuratelythaneither thewell-studied crcw pramor erew prammodels:the crcwmodeldoesnotadequatelypenalizealgorithmswithhighcontentiontosharedmemorylocations,whilethe erewmodelistoostrictinitsinsistenceonzerocontentionateachstep. The qrqw pramisstrictlymorepowerfulthanthe erew pram.Thispapershows aseparationof p lg nbetweenthetwomodels,andpresentsfasterandmoreecient qrqwalgorithmsforseveralbasicproblems,suchaslinearcompaction,leaderelection,andprocessorallocation.Furthermore,wepresentawork-preservingemulationof the qrqw pramwithonlylogarithmicslowdownonValiant's bspmodel,andhence onhypercube-typenon-combiningnetworks, even when latency, synchronization, and memory granularity overheads are taken into account.Thismatchesthebestknown emulationresultforthe erew pram,andconsiderablyimprovesuponthebestknown ecientemulationforthe crcw pramonsuchnetworks.Finally,thepaperpresents severallowerboundresultsforthismodel,includinglowerboundsonthetimerequired forbroadcastingandforleaderelection.

Cited by 0

BANDWIDTH MANAJEMEN QUEUE TREE VS SIMPLE QUEUE

Darmawan, Erristhya, Purnama, Indra, Mahardika, Tomy Ihromi Rohmat et al. · Gunadarma University Repository (Gunadarma University)

Suatu produk memiliki dua fitur dalam memanajemen bandwidth. Fitur tersebut yaitu simple queue dan queue
\ntree. Bagian administrator jaringan komputer seringkali kebingungan dalam memilih bandwidth management
\nkarena setiap fitur pada produk tersebut memiliki kelebihan dan kekurangan. Dalam paper ini mencoba untuk
\nmembandingkan kedua fitur dari manajemen bandwidth tersebut (simple queue dan queue tree), sehingga para
\nadministrator jaringan mendapatkan cara yang tepat dalam memanajemen bandwith. Untuk mendapatkan hasil
\npercobaan tersebut maka akan dilakukan pendekatan dengan cara melakukan percobaan secara langsung yang
\ndipraktekkan menggunakan PC (personal computer), sistem operasi untuk memanajemen bandwith, dan
\naplikasi-aplikasi pendukungnya.Kami berharap paper ini dapat membantu orang yang bekerja pada bagian
\njaringan dalam menentukan pilihan untuk memanajemen bandwith yang tepat pada jaringan yang dia miliki.

Cited by 5Open access

HOP Queue: Hyperspectral Onboard Processing Queue Demonstration

Davis, Kelly Gresham, Kher, Aditya, Biddlecomb, Jathan et al. · Digital Commons - USU (Utah State University) · 2022

The HOP Queue (Hyperspectral Onboard Processing Queue) demonstration leverages emerging COTS AI accelerators and GPUs to perform on-board processing of hyperspectral imagery data, with the aim of providing near- real time conservation-oriented data and metrics from Low Earth Orbit (LEO). These include forest health, fire detection, and coastal water health. Phase 1 of this project is currently underway, including a completed lab demonstration of this technology and ongoing flight testing. The data from this mission will support Northrop Grumman’s enterprise “Technology for Conservation” campaign and will be provided to NASA’s Surface Biology and Geology (SBG) organization, as well as other conservation efforts.

Cited by 0

La queue

William Rankin · 2020

Cited by 0

La queue

William Rankin · 2020

Cited by 0