We investigate strong dichotomical behaviour of the number of equivalence classes and related cardinal. Saharon: compare with Journal proofs! 2000 Mathematics Subject Classification. 20K99

abstract: comparison of justice in islam and utilitarianism this article is to explain and compare justice in islam and utilitarianism. first, it is pointed to difinition and necessary and divisions of justice in islam: justice is putting of everything in its suit place. because of being absoulatly complete of god, his commands and prohibitions are justicely. knowledge of all human needs and th...

We describe a program logic for weak memory (also known as relaxed memory). The logic is based on Hoare logic within a thread, and rely/guarantee between threads. It is presented via examples, giving proofs of many weak-memory litmus tests. It extends to coherence but not yet to synchronised assignment (compare-and-swap, load-logical/store-conditional). It deals with conditionals and loops but ...

We present a new wait-free algorithm for concurrently accessing a red-black tree in an asynchronous shared memory system that supports search, insert, update and delete operations using single-word compare-and-swap instructions. Search operations in our algorithm are fast and execute only read and write instructions (and no atomic instructions) on the shared memory. The algorithm is obtained th...

Recent research on mutual exclusion for shared-memory systems has focused on local spinalgorithms. Performance is measured using the remote memory references (RMRs) metric. Ascommon in recent literature, we consider a standard asynchronous shared memory model withN processes, which allows atomic read, write and compare-and-swap (short: CAS) operations.In such a model, the asympt...

While compare-and-swap (CAS) and load-linked / store-conditional (LL/SC) are equally powerful in principle, there are circumstances in which one or the other is significantly easier to use. We highlight one example in this paper. Specifically, we use LL/SC to significantly simplify the “stealing” and “merging” mechanism used to ensure correct nonblocking behavior in Harris and Fraser’s word-bas...

Grids enable sharing, selection and aggregation of geographically distributed resources among various organizations. They are emerging as promising computing paradigms for resource and computeintensive scientific workflow applications modeled as Directed Acyclic Graph (DAG) with intricate inter-task dependencies. With the growing popularity of real-time applications, streaming workflows continu...

Lock-free algorithms are not required to guarantee a bound on the number of steps an operation takes under contention, so we cannot use the usual worst-case analysis to quantify them. A natural alternative is to consider the worst-case time complexity of operations executed in the more common uncontended case. Many state-of-the-art lock-free algorithms rely on compare-and-swap (CAS) or similar ...