Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,222
consistency model like Strict Consistency, Sequential Consistency,
"... Abstract—This paper is on the general discussion of memory ..."
Request Reordering to Enhance the Performance of Strict Consistency Models”, Computer Architecture Letters
, 2002
"... Abstract--Advances in ILP techniques enable strict consistency models to relax memory order through speculative execution of memory operations. However, ordering constraints still hinder the performance because speculatively executed operations cannot be committed out of program order for the possib ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract--Advances in ILP techniques enable strict consistency models to relax memory order through speculative execution of memory operations. However, ordering constraints still hinder the performance because speculatively executed operations cannot be committed out of program order
Analyzing Recon gurable Algorithms for Managing Replicated Data with Strict Consistency Requirements: A Case Study
"... In this paper, we address recon gurable algorithms for managing replicated data with strict consistency requirements, that is, whenever the user performs an update operation, the update is applied to all reachable copies as part of the update protocol. A key issue of designing such algorithms is to ..."
Abstract
- Add to MetaCart
In this paper, we address recon gurable algorithms for managing replicated data with strict consistency requirements, that is, whenever the user performs an update operation, the update is applied to all reachable copies as part of the update protocol. A key issue of designing such algorithms
A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING
- COMBINATORICA
, 1984
"... We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract
-
Cited by 860 (3 self)
- Add to MetaCart
the ellipsoid algorithm by a factor of O(n~'~). We prove that given a polytope P and a strictly in-terior point a E P, there is a projective transformation of the space that maps P, a to P', a ' having the following property. The ratio of the radius of the smallest sphere with center a
Learning Decision Lists
, 2001
"... This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \k-DL" { the set of decision lists with conjunctive clauses of size k at each decision. Since k ..."
Abstract
-
Cited by 427 (0 self)
- Add to MetaCart
strictly increases the set of functions which are known to be polynomially learnable, in the sense of Valiant (1984). Our proof is constructive: we present an algorithm which can efficiently construct an element of k-DL consistent with a given set of examples, if one exists.
A Query Language and Optimization Techniques for Unstructured Data
, 1996
"... A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in tree-like structures whose components can be used ..."
Abstract
-
Cited by 407 (35 self)
- Add to MetaCart
be represented as fixed-depth trees, and on such trees UnQL is equivalent to the relational algebra. The novelty of UnQL consists in its programming constructs for arbitrarily deep data and for cyclic structures. While strictly more powerful than query languages with path expressions like XSQL, UnQL can still
An Object Calculus for Asynchronous Communication
- Proceedings of the European Conference on Object-Oriented Programming (ECOOP
, 1991
"... This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on ß-calculus, the communication primitive of the formal system is purely asynchronous, which makes it unique among various concurrency formalisms. Computationally this resu ..."
Abstract
-
Cited by 392 (35 self)
- Add to MetaCart
this results in a consistent reduction of Milner's calculus, while retaining the same expressive power. Seen semantically asynchronous communication induces a surprisingly different framework where bisimulation is strictly more general than its synchronous counterpart. This paper shows basic construction
Proof of a Fundamental Result in Self-Similar Traffic Modeling
- COMPUTER COMMUNICATION REVIEW
, 1997
"... We state and prove the following key mathematical result in self-similar traffic modeling: the superposition of many ON/OFF sources (also known as packet trains) with strictly alternating ON- and OFF-periods and whose ON-periods or OFF-periods exhibit the Noah Effect (i.e., have high variability or ..."
Abstract
-
Cited by 290 (8 self)
- Add to MetaCart
We state and prove the following key mathematical result in self-similar traffic modeling: the superposition of many ON/OFF sources (also known as packet trains) with strictly alternating ON- and OFF-periods and whose ON-periods or OFF-periods exhibit the Noah Effect (i.e., have high variability
Self-Consistent Strictly Localized Orbitals
, 2006
"... Abstract: Among all the Quantum Mechanics/Molecular Mechanics (QM/MM) methods available to describe large molecular systems, the Local Self-Consistent Field/MM (LSCF/MM) one uses frozen doubly occupied Strictly Localized Bonding Orbital (SLBO) to connect the QM fragment to the one treated at the MM ..."
Abstract
- Add to MetaCart
Abstract: Among all the Quantum Mechanics/Molecular Mechanics (QM/MM) methods available to describe large molecular systems, the Local Self-Consistent Field/MM (LSCF/MM) one uses frozen doubly occupied Strictly Localized Bonding Orbital (SLBO) to connect the QM fragment to the one treated at the MM
Performance Evaluation of Memory Consistency Models for Shared-Memory Multiprocessors
"... The memory consistency model supported by a multiprocessor architecture determines the amount of buffering and pipelining that may be used to hide or reduce the latency of memory accesses. Several different consistency models have been proposed. These range from sequential consistency on one end, al ..."
Abstract
-
Cited by 171 (10 self)
- Add to MetaCart
, allowing very limited buffering, to release consistency on the other end, allowing extensive buffering and pipelining. The processor consistency and weak consistency models fall in between. The advantage of the less strict models is increased performance potential. The disadvantage is increased hardware
Results 1 - 10
of
3,222
