Results 1 to 10 of about 2,151,378 (190)

A Survey on Adversarial Contention Resolution [PDF]

open access: yesACM Computing Surveys
Contention resolution addresses the challenge of coordinating access by multiple processes to a shared resource such as memory, disk storage, or a communication channel. Originally spurred by challenges in database systems and bus networks, contention resolution has endured as an important abstraction for resource sharing, despite decades of ...
Maxwell Young   +2 more
exaly   +7 more sources

Contention Resolution With Constant Expected Delay [PDF]

open access: yesJournal of the ACM, 2000
We study contention resolution in a multiple-access channel such as the Ethernet channel. In the model that we consider,nusers generate messages for the channel according to a probability distribution. Raghavan and Upfal have given a protocol in which the expecteddelay(time to get serviced) of every message is O(logn) when messages are generated ...
Aravind Srinivasan   +2 more
exaly   +3 more sources

An Optimal Greedy Algorithm for the Single Access Contention Resolution Problem

open access: yesIEEE Access, 2019
We present the greedy optimal algorithm for contention resolution (GOAL-CR), a greedy algorithm that solves a variant of the standard contention resolution problem where a set of nodes want to access a shared resource only once, and the objective is to ...
Itzel C. Olivos-Castillo   +4 more
doaj   +3 more sources

Contention Resolution with Predictions [PDF]

open access: yesProceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 2021
In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network sizes that predicts the likelihood of each size occurring.
Seth Gilbert   +3 more
openaire   +3 more sources

Analysis of the Distributed Queueing Algorithm in a Multichannel Network with Mixed-Type Traffic [PDF]

open access: yesEAI Endorsed Transactions on Internet of Things, 2021
Networks such as LTE-M, NB-IoT, LoRa and SigFox are being deployed for massive IoT communications. However, the Aloha protocols used for the media access are inefficient when the network size is high.
Romeo Nibitanga   +2 more
doaj   +1 more source

Contention resolution on a restrained channel [PDF]

open access: yes2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS), 2020
9 ...
Elijah Hradovich   +2 more
openaire   +2 more sources

Investigation of Contention or Appositional Function in Persian Grammar [PDF]

open access: yesLiterary Arts, 2022
The grammatical argument of contention means playing two functions by one word or phrase in Persian language sentences. There is ambiguity and disagreement in Persian grammar articles and books about contention or the appositional function.
Ali Sabbaghi, Tahere Mirhashemi
doaj   +1 more source

Contention resolution without collision detection [PDF]

open access: yesProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
This paper focuses on the contention resolution problem on a shared communication channel that does not support collision detection. A shared communication channel is a multiple access channel, which consists of a sequence of synchronized time slots. Players on the channel may attempt to broadcast a packet (message) in any time slot.
Bender, Michael A.   +3 more
openaire   +4 more sources

Islamic Eschatology and Religious Differences [PDF]

open access: yesTheosophia Islamica, 2021
The issue of religious diversity is explicitly addressed in a number of āyāt of the Qur’ān. One of the recurrent themes that is found in these passages is the resolution of religious differences.
Gary Carl (Muhammad) Legenhausen
doaj   +1 more source

OBS contention resolution performance [PDF]

open access: yesPerformance Evaluation, 2007
In this paper, a performance comparison of resolution policies specific to optical burst switching is presented. A framework, based on a reduced-load approximation, is developed to estimate path blocking probabilities in an optical burst switched network of arbitrary topology, in which any combination of the following resolution policies is applied in ...
Andrew Zalesky   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy