نتایج جستجو برای: contention based

تعداد نتایج: 2939872  

Journal: :Open Theology 2023

Abstract The question of the exact role theology in Schmitt’s political remains undecided. Several authors have raised this and distinct answers been given. In order to reach an accurate representation political–theological dimension work, I will attempt interpretation which takes into account not only more widely known theses, but also perceived esoteric unsaid aspects his work. Against Heinri...

Journal: :International Review of Social History 2004

Journal: :International Journal of Future Computer and Communication 2015

2017
Shane Griffiths Ronald West Andrew R. Davis Ken Russell

Understanding recolonization processes of intertidal fish assemblages is integral for predicting the consequences of significant natural or anthropogenic impacts on the intertidal zone. Recolonization of experimentally defaunated intertidal rockpools by fishes at Bass Point, New South Wales (NSW), Australia, was assessed quantitatively by using one long-term and two short-term studies. Rockpool...

1996
Sherry Moore Lionel M. Ni

Various processor allocation strategies have been proposed for scalable parallel computers (SPCs). These strategies try to maximize the overall system utilization and, in the mean time, try to avoid network contention among different processor partitions. This paper provides an intensive simulation study investigating whether contention-free processor allocation strategies are indeed important....

2008
Rachid Guerraoui Thomas A. Henzinger Vasu Singh

Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first deterministic specification automata for strict serializability and opacity in STMs. Using an antichain-based tool, we show our deterministic specifications to be equivalent to more intuitive, nondeterministic speci...

Journal: :Parallel Processing Letters 2016
Tyler Crain Vincent Gramoli Michel Raynal

This paper presents a fast concurrent binary search tree algorithm. To achieve high performance under contention, the algorithm divides update operations within an eager abstract access that returns rapidly for efficiency reason and a lazy structural adaptation that may be postponed to diminish contention. To achieve high performance under read-only workloads, it features a rebalancing mechanis...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید