Results 191 to 200 of about 3,131,448 (250)
Some of the next articles are maybe not open access.

Transactive Control in Smart Cities

Proceedings of the IEEE, 2018
One of the important goals of a smart city is to increase the quality of urban mobility. This paper will explore the use of dynamic tariffs for this purpose. Transactive control, the concept of feedback through economic transactions, is a promising concept for accomplishing such dynamic tariffs, and is the focus of this paper.
Anuradha M. Annaswamy   +5 more
openaire   +1 more source

Residential transactive control demonstration

ISGT 2014, 2014
Arguably the most exciting aspect of the smart grid vision is the full participation of end-use resources with all forms of generation and energy storage in the reliable and efficient operation of an electric power system. Engaging all of these resources in a collaborative manner that respects the objectives of each resource, is sensitive to the system
Steven E. Widergren   +3 more
openaire   +2 more sources

Java call control, coordination, and transactions

IEEE Communications Magazine, 2000
No description ...
Ravi Jain   +3 more
openaire   +3 more sources

Transaction Groups : A Model for Controlling Cooperative Transactions

1990
Many interactive applications that are being developed for high-performance workstations involve several users in a collaborative activity. Modern database systems synchronize activities on shared data by ensuring that the results are serializable. Serializability is often too limiting a correctness criterion for cooperative work.
Mary F. Fernandez, Stanley B. Zdonik
openaire   +2 more sources

Concurrency Control Based on Transaction Clustering

2021 IEEE 37th International Conference on Data Engineering (ICDE), 2021
Concurrency control is a mechanism that database systems provide to allow multiple transactions to be executed at the same time while enforcing isolation. The concurrency control algorithm is key to performance of a database system. However, different concurrency control algorithms have different strengths and weaknesses, making each of them fits only ...
Xuebin Su, Hongzhi Wang 0001, Yan Zhang
openaire   +2 more sources

Concurrency control of tiered flat transactions

1995
In some database systems it has become evident that transactions can consist of a succession of ‘tiers’ where different types of data are being accessed. Despite the different nature of the data accessed by each tier the transactions cannot be split up because of the interdependencies between the albeit different data of the individual tiers.
Keane, John, Hussak, Walter
openaire   +3 more sources

Concurrency control for resilient nested transactions

Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '83, 1983
A formal framework is developed for proving correctness of algorithms which implement nested transactions. In particular, a simple "action tree" data structure is defined, which describes the ancestor relationships among executing transactions and also describes the views which different transactions have of the data.
openaire   +4 more sources

Concurrency control for step-decomposed transactions

Information Systems, 1999
Abstract The throughput of a transaction processing system can be improved by decomposing transactions into steps and allowing the steps of concurrent transactions to be interleaved. In some cases all interleavings are assumed to be acceptable; in others certain interleavings are forbidden.
Arthur J. Bernstein   +2 more
openaire   +1 more source

From Transactional Distance to Transactional Control

2007
This book offers an exploration of the ways that a learning trajectory is determined, and, in particular, how an online learning environment can affect that trajectory. It provides suggestions about how, primarily through technologies that underlie what is vulgarly known as “Web 2.0,” networked learning environments should be constructed to give ...
openaire   +1 more source

A concurrency control scheme for nested transactions

Microprocessing and Microprogramming, 1989
Abstract Locking rules for concurrency control in nested transaction model, in which parent/child parallelism, sibling parallelism, and arbitrary commitment-dependence relationship between transactions are allowed, are presented. The locking rules are based on the lock transformation scheme that never allows the commit deadlock to occur, which could ...
SHIN, DC Shin, Dongchun   +1 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy