Exploiting dynamic transaction queue size in scalable memory systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable In-Memory Transaction Processing with HTM

We propose a new HTM-assisted concurrency control protocol, called HTCC, that achieves high scalability and robustness when processing OLTP workloads. HTCC attains its goal using a two-pronged strategy that exploits the strengths of HTM. First, it distinguishes between hot and cold records, and deals with each type differently – while accesses to highly contended data are protected using conven...

متن کامل

On Scalable and Flexible Transaction and Query Processing in Main-Memory Database Systems

The hardware landscape for database systems has changed dramatically over the past two decades. Today, the traditional database system architecture that was pioneered by System R and is implemented by IBM DB2, Microsoft SQL Server, Oracle and Postgres, shows weaknesses in all major areas of application of commercial database systems: operational transaction processing, decision support and busi...

متن کامل

A Non - Blocking Atomic - Multicast Service for Scalable In - memory Transaction Systems

Atomic Multicasting is central to managing replication. Our focus is on its deployment for enhancing scalability and performance of in-memory transactional systems where data replication is essential. When it is deployed as an external service, enhancement is demonstrably accomplished when no node within the service crashes. Since known atomic-multicast protocols block whenever a node is crashe...

متن کامل

A Scalable Shared Queue on a Distributed Memory Machine

The emergence of low latency, high throughput routers means that network locality issues no longer dominate the performance of parallel algorithms. One of the key performance issues is now the even distribution of work across the machine, as the problem size and number of processors increase. This paper describes the implementation of a highly scalable shared queue, supporting the concurrent in...

متن کامل

Transaction scheduling in dynamic composite multidatabase systems

This paper proposes composite multidatabase architecture consisting of multiple, possibly heterogeneous, peer multidatabase servers distributed on a communications network. The domain of each multidatabase server is treated as a multidatabase cell. Global transactions could span multiple multidatabase cells, sometimes forcing multidatabase servers to act as component database systems. Although ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2017

ISSN: 1432-7643,1433-7479

DOI: 10.1007/s00500-016-2470-x