Aplikasi Persediaan Stok Barang Di CV. Surya Fajar Cemerlang

The business process in a company must have transactions, both sales and purchase transactions. Similarly, what happened in CV. Surya Fajar Cemerlang is engaged in trading building materials and electronic equipment. In processing transactions, administrative staff are responsible for recording each transaction in the book sales and purchases. However, data errors often occur due to poorly filed data. One way to overcome this problem is to use a stock inventory application. This application can process incoming goods and items that come out, so they can find out the amount of stock and can make a report on goods transactions. Making this application uses the waterfall methodology, Visual Basic .NET programming language and MySQL database. The application of processing incoming and outgoing goods is expected to help the company overcome the chaos of data archiving so that transactions are smoother and run well

An Analytical Review of Orientation Based Concurrency Control Algorithm

There is an ever-increasing demand for higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency.Concurrency control in Database management systems ensures that database transactions are performed concurrently without violating the data integrity of the database. Thus concurrency control is an essential element for correctness in any system where two database transactions or more, executed with time overlap, can access the same data. There are problems like Deadlock,Livelock and prevention of these problems is vital in concurrency control of distributed database systems.Many techniques have been proposed for managing concurrent execution of transactions in database systems.A new method for concurrency control in distributed DBMS2019;s,is discussed which will improve system performance by reducing the chances of deadlock and livelock and reducing restart ratio

Preemptive Software Transactional Memory

In state-of-the-art Software Transactional Memory (STM) systems, threads carry out the execution of transactions as non-interruptible tasks. Hence, a thread can react to the injection of a higher priority transactional task and take care of its processing only at the end of the currently executed transaction. In this article we pursue a paradigm shift where the execution of an in-memory transaction is carried out as a preemptable task, so that a thread can start processing a higher priority transactional task before finalizing its current transaction. We achieve this goal in an application-transparent manner, by only relying on Operating System facilities we include in our preemptive STM architecture. With our approach we are able to re-evaluate CPU assignment across transactions along a same thread every few tens of microseconds. This is mandatory for an effective priority-aware architecture given the typically finer-grain nature of in-memory transactions compared to their counterpart in database systems. We integrated our preemptive STM architecture with the TinySTM package, and released it as open source. We also provide the results of an experimental assessment of our proposal based on running a port of the TPC-C benchmark to the STM environment

Multi-step transactions specification and verification in a mobile database community

Executions of concurrent multi-step transactions interleave steps in ways that improve the throughput of the particular transactions processing system. In this paper, we use temporal logic to specify and verify formally the correctness of local and mobile transactions executing concurrently on a mobile database. The correctness condition is that of serializability which we specify in CTL (Computational Tree Logic). The reason for using a temporal logic such as CTL, is that the method can be extended to verifying infinite schedules modelling mobile environments such as MDBCs (mobile database communities). The verification is carried out using the symbolic model checking NuSMV. We verify that a local scheduler based on timestamps serializes local and mobile multi-step transactions

The United Nations and the Human Rights Issue

This paper demonstrates a new class of bugs that is likely to occur in enterprise OpenFlow deployments. In particular, step-by-step, reactive establishment of paths can cause network-wide inconsistencies or performance- and space-related inefficiencies. The cause for this behavior is inconsistent packet processing: as the packets travel through the network they do not encounter consistent state at the OpenFlow controller. To mitigate this problem, we propose to use transactional semantics at the controller to achieve consistent packet processing. We detail the challenges in achieving this goal (including the inability to directly apply database techniques), as well as a potentially promising approach. In particular, we envision the use of multi-commit transactions that could provide the necessary serialization and isolation properties without excessively reducing network performance.QC 20140707</p