Thematische Bibliographien / Transaction systems (Computer systems)

Auswahl der wissenschaftlichen Literatur zum Thema „Transaction systems (Computer systems)“

Autor: Grafiati
Veröffentlicht am 4. Juni 2021
Zuletzt aktualisiert am 28. Februar 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Transaction systems (Computer systems)" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Zeitschriftenartikel zum Thema "Transaction systems (Computer systems)":

1

Кучук, Н. Г., Г. М. Зубрицький und Г. А. Кучук. „Resource distribution method in computer systems on integrated software platforms“. Системи обробки інформації, Nr. 1 (168) (10.02.2022): 36–42. http://dx.doi.org/10.30748/soi.2022.168.04.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Computer Systems on Integrated Software Platforms are gaining popularity among users. They have a number of advantages over other platforms. In particular, this is a reduction in maintenance costs and the ability to quickly deploy additional Hardware & Software without stopping the system. But there are also a number of disadvantages. The most significant of these is an increase in the processing time for transactions of users using data warehouses. One of the directions of its solution is the formation of resource distribution, which is focused on minimizing resource costs. A mathematical model of resource distribution during transactions in CS on ISP is proposed. The distribution quality is determined by the criterion of minimizing the total transaction execution time. The admissible set of distributions is formed using the method of penalties for the execution of transactions. This further refines the integrated infrastructure. Simulation modeling of the process of distributing a computing resource with a selected plan made it possible to formulate requirements for the algorithm for solving the problem of scheduling transactions in an integrated environment. The proposed method also makes it possible to carry out operational rescheduling of transaction execution and reduce time costs when making operational changes to the transaction execution plan.
2

Polovina, Simon. „A Transaction-Oriented Architecture for Enterprise Systems“. International Journal of Intelligent Information Technologies 9, Nr. 4 (Oktober 2013): 69–79. http://dx.doi.org/10.4018/ijiit.2013100105.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Many enterprises risk business transactions based on information systems that are incomplete or misleading, given that 80-85% of all corporate information remains outside of their processing scope. It highlights that the bulk of information is too unstructured for these systems to process, but must be taken into account if those systems are to provide effective support. Computer technology nonetheless continues to become more and more predominant, illustrated by SAP A.G. recognising that 65-70% of the world's transactions are run using their technology. Using SAP as an illustrative case study, and by bringing in the benefits of technologies such as Service-Oriented Architecture (SOA), Business Process Management (BPM), Enterprise Architecture Frameworks (EA) and Conceptual Structures, a practical roadmap is identified to a Transaction-Oriented Architecture (TOA) that is predicated on the Transaction Concept. This concept builds upon the Resources-Events-Agents (REA) modelling pattern that is close to business reality. Enterprise systems can thus better incorporate that missing 80-85% of hitherto too-unstructured information thereby allowing enterprise systems vendors such as SAP, their competitors, customers, suppliers and partners to do an ever better job with the world's transactions.
3

Marifati, Imam Soleh, und Vadlya Maarif. „Sistem Informasi Akuntansi Pemesanan dan Pembayaran (Ordering and Billing) Makanan dan Minuman Berbasis Android Pada RM. Ayam Goreng “Padamara” Purbalingga“. Indonesian Journal on Software Engineering (IJSE) 4, Nr. 2 (23.07.2019): 33–38. http://dx.doi.org/10.31294/ijse.v4i2.5978.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Abstract - Ordering and billing transactions of food and beverages in a restaurant business are in the revenue cycle. Transactions in the revenue cycle have an important role for the company because from this transaction the company gets cash income. The use of information technology to support the transaction process can increase the effectiveness of the transaction process. Transactions can be processed quickly and accurately. Restaurant business can use accounting information systems to improve the effectiveness and efficiency of transaction processes in the revenue cycle. A computer-based accounting information system is needed in processing transactions. In this study, the authors developed the application of accounting information systems to process transactions in the revenue cycle for restaurant business activities. This application processes transaction data starting from ordering, payment and making revenue reports from restaurant business activities. Keywords: Order, Billing, Accounting Information System
4

RUSINKIEWICZ, MAREK, PIOTR KRYCHNIAK und ANDRZEJ CICHOCKI. „TOWARDS A MODEL FOR MULTIDATABASE TRANSACTIONS“. International Journal of Cooperative Information Systems 01, Nr. 03n04 (Dezember 1992): 579–617. http://dx.doi.org/10.1142/s0218215792000155.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In many application areas the information that may be of interest to a user is stored under the control of multiple, autonomous database systems. To support global transactions in a multidatabase environment, we must coordinate the activities of multiple Database Management Systems that were designed for independent, stand-alone operation. The autonomy and heterogeneity of these systems present a major impediment to the direct adaptation of transaction management mechanisms developed for distributed databases. In this paper we introduce a transaction model designed for a multidatabase environment. A multidatabase transaction is defined by providing a set of (local) sub-transactions, together with their precedence and dataflow requirements. Additionally, the transaction designer may specify failure atomicity and execution atomicity requirements of the multidatabase transaction. These high-level specifications are then used by the scheduler of a multidatabase transaction to assure that its execution satisfies the constraints imposed by the semantics of the application. Uncontrolled interleaving of multidatabase transactions may lead to the violation of interdatabase integrity constraints. We discuss the issues involved in a concurrent execution of multidatabase transactions and propose a new concurrency control correctness criterion that is less restrictive than global serializability. We also show how the multidatabase SQL can be extended to allow the user to specify multidatabase transactions in a nonprocedural way.
5

Stewart, Brian H. „Transaction exchange management systems for successful systems integration“. Computers & Industrial Engineering 17, Nr. 1-4 (Januar 1989): 536–41. http://dx.doi.org/10.1016/0360-8352(89)90119-8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Baldoni, R. „Consistent Checkpointing for Transaction Systems“. Computer Journal 44, Nr. 2 (01.02.2001): 92–100. http://dx.doi.org/10.1093/comjnl/44.2.92.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Appelbaum, Deniz, und Robert A. Nehmer. „Auditing Cloud-Based Blockchain Accounting Systems“. Journal of Information Systems 34, Nr. 2 (25.10.2019): 5–21. http://dx.doi.org/10.2308/isys-52660.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
ABSTRACT In this research, we often refer to Nakamoto's (2008) seminal paper, “Bitcoin: A Peer-to-Peer Electronic Cash System,” to consider his proposed abstracted characteristics and how auditors could look at companies' transactions interfacing to a private/semi-private blockchain with Nakamoto's general characteristics and address the related audit domain for such transactions. We then take these design requirements for auditors and, using design science research (DSR), we consider the transaction processing and contracting contexts that match those requirements in permissioned blockchains.The blockchains discussed in this paper would typically be business-to-business or business-to-consumer, private or semi-private, and residing in either a private, semi-private, or public cloud. Those blockchains will each have their own design and operational procedures, including validation procedures (the miners). We consider the audit issues of data reliability, data security, and transaction transparency in accounting transactions that lend themselves to a permissioned blockchain as well as other contextual issues.
8

Raza, Zeeshan, Irfan ul Haq, Muhammad Muneeb und Omair Shafiq. „Energy Efficient Multiprocessing Solo Mining Algorithms for Public Blockchain Systems“. Scientific Programming 2021 (31.10.2021): 1–13. http://dx.doi.org/10.1155/2021/9996132.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Blockchain as a decentralized distributed ledger is revolutionizing the world with a secure design data storage mechanism. In the case of Bitcoin, mining involves a process of packing transactions in a block by calculating a random number termed as a nonce. The nonce calculation is done by special nodes called miners, and all the miners follow the Proof of Work (PoW) mining mechanism to perform the mining task. The transaction verification time in PoW-based blockchain systems, i.e., Bitcoin, is much slower than other digital transaction systems such as PayPal. It needs to be quicker if a system adapts PoW-based blockchain solutions, where there are thousands of transactions being computed at a time. Besides this, PoW mining also consumes a lot of energy to calculate the nonce of a block. Mining pools resulting into aggregated hashpower have been a popular solution to speed up the PoW mining, but they can be attacked by using different types of attacks. Parallel computing can be used to speed up the solo mining methods by utilizing the multiple processes of the contributing processors. In this research, we analyze various consensus mechanisms and see that the PoW-based blockchain systems have the limitations of low transaction confirmation time and high energy consumption. We also analyze various types of consensus layer attacks and their effects on miners and mining pools. To tackle these issues, we propose parallel PoW nonce calculation methods to accelerate the transaction verification process especially in solo mining. We have tested our techniques on different difficulty levels, and our proposed techniques yield better results than the traditional nonce computation mechanisms.
9

Alekhin, V. A. „Designing Electronic Systems Using SystemC and SystemC–AMS“. Russian Technological Journal 8, Nr. 4 (06.08.2020): 79–95. http://dx.doi.org/10.32362/2500-316x-2020-8-4-79-95.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Current trends in the design of electronic systems is the use of embedded systems based on systems on a chip (System-on-Chip (SoC)) or (VLSI SoC). The paper discusses the design features of electronic systems on a chip using the SystemC design and verification language. For the joint design and simulation of digital systems hardware and software, seven modeling levels are presented and discussed: executable specification, disabled functional model, temporary functional model, transaction-level model, behavioral hardware model, accurate hardware model, register transfer model. The SystemC design methodology with functional verification is presented, which reduces development time.The architecture of the SystemC language and its main components are shown. The expansion of SystemC–AMS for analog and mixed analog-digital signals and its use cases in the design of electronic systems are considered. Computing models are discussed: temporary data stream (TDF), linear signal stream (LSF) and electric linear networks (ELN). The architecture of the SystemC–AMS language standard is shown and examples of its application are given. It is shown that the design languages SystemC and SystemC–AMS are widely used by leading developers of computer-aided design systems for electronic devices.
10

SCHWARZ, KERSTIN, CAN TÜRKER und GUNTER SAAKE. „INTEGRATING EXECUTION DEPENDENCIES INTO THE TRANSACTION CLOSURE FRAMEWORK“. International Journal of Cooperative Information Systems 08, Nr. 02n03 (Juni 1999): 111–38. http://dx.doi.org/10.1142/s0218843099000071.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
The transaction closure framework provides means to describe and reason about different kind of dependencies between interrelated transactions. In this paper, we investigate execution dependencies for describing certain control flows among related transactions of a transaction closure. In particular, we consider the transitivity property for all kinds of transaction execution dependencies and present a complete and minimal set of rules for reasoning about the transitivity of execution dependencies. Furthermore, we analyze the relationship between execution and termination dependencies and point out that some dependency combinations are incompatible. Using derived transitive dependencies, we are able to conclude how arbitrary transactions of a transaction closure are transitively interrelated and, thus, to detect contradictory dependency specifications as well as superfluous transactions.
Mehr Quellen
Die Auswahlen zum Thema "Transaction systems (Computer systems)" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher

Dissertationen zum Thema "Transaction systems (Computer systems)":

1

Yoo, Richard M. „Adaptive transaction scheduling for transactional memory systems“. Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22587.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2008.
Committee Chair: Lee, Hsien-Hsin; Committee Member: Blough, Douglas; Committee Member: Yalamanchili, Sudhakar.
2

Prabhu, Nitin Kumar Vijay. „Transaction processing in Mobile Database System“. Diss., UMK access, 2006.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006.
"A dissertation in computer science and informatics and telecommunications and computer networking." Advisor: Vijay Kumar. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Nov. 9, 2007. Includes bibliographical references (leaves 152-157). Online version of the print edition.
3

Chen, Jianwen, University of Western Sydney, of Science Technology and Environment College und School of Computing and Information Technology. „Data and knowledge transaction in mobile environments“. THESIS_CSTE_CIT_Chen_J.xml, 2004. http://handle.uws.edu.au:8081/1959.7/806.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Advances in wireless networking technology have engendered a new paradigm of computing, called mobile computing; in which users carrying portable devices have access to a shared infrastructure independent of their physical location. Mobile computing has matured rapidly as a field of computer science. In environments of mobile computing, the mobility and disconnection of portable computing devices introduce many new challenging problems that have never been encountered in conventional computer networks. New research issues combine different areas of computer science: networking, operating systems, data and knowledge management, and databases. This thesis studies data and knowledge transaction in mobile environments. To study transaction processing at the fundamental and theoretical level in mobile environments, a range of classical notions and protocols of transaction processing are rechecked and redefined in this thesis, and form the foundation for studying transaction processing in mobile environments. A criterion for mobile serial history is given and two new concurrency theorems are proved in mobile environments. In addition to data transaction, this thesis explores knowledge transaction in mobile environments. To study knowledge transaction in mobile environments this thesis presents and formalizes a knowledge transaction language and model for use in mobile computing environments. The thesis further formalizes a framework/model for a mobile logic programming multi-agent system which can be used to study knowledge transaction in multi-agent systems in mobile environments and is a very early effort towards a formal study of knowledge base and intelligent agents in mobile environments. This work provides a foundation for the formal specification and development of real-world mobile software systems, in the same way as traditional software systems have developed.
Doctor of Philosophy (PhD) (Science)
4

Xia, Yu S. M. Massachusetts Institute of Technology. „Logical timestamps in distributed transaction processing systems“. Thesis, Massachusetts Institute of Technology, 2018. https://hdl.handle.net/1721.1/122877.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 73-79).
Distributed transactions are such transactions with remote data access. They usually suffer from high network latency (compared to the internal overhead) during data operations on remote data servers, and therefore lengthen the entire transaction executiont time. This increases the probability of conflicting with other transactions, causing high abort rates. This, in turn, causes poor performance. In this work, we constructed Sundial, a distributed concurrency control algorithm that applies logical timestamps seaminglessly with a cache protocol, and works in a hybrid fashion where an optimistic approach is combined with lock-based schemes. Sundial tackles the inefficiency problem in two ways. Firstly, Sundial decides the order of transactions on the fly. Transactions get their commit timestamp according to their data access traces. Each data item in the database has logical leases maintained by the system. A lease corresponds to a version of the item. At any logical time point, only a single transaction holds the 'lease' for any particular data item. Therefore, lease holders do not have to worry about someone else writing to the item because in the logical timeline, the data writer needs to acquire a new lease which is disjoint from the holder's. This lease information is used to calculate the logical commit time for transactions. Secondly, Sundial has a novel caching scheme that works together with logical leases. The scheme allows the local data server to automatically cache data from the remote server while preserving data coherence. We benchmarked Sundial along with state-of-the-art distributed transactional concurrency control protocols. On YCSB, Sundial outperforms the second best protocol by 57% under high data access contention. On TPC-C, Sundial has a 34% improvement over the state-of-the-art candidate. Our caching scheme has performance gain comparable with hand-optimized data replication. With high access skew, it speeds the workload by up to 4.6 x.
"This work was supported (in part) by the U.S. National Science Foundation (CCF-1438955)"
by Yu Xia.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
5

Tang, Rong. „Transaction management in peer-to-peer multidatabase systems“. Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/27055.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Peer-to-peer multidatabase systems (P2P MDBSs) are dynamic networks of peers with total absence of any global schema, any central administrative authority, any data integration, any global access to multiple databases, permanent participation of databases, etc. Global and local transactions are supported in P2P MDBSs. A global transaction generates descendent transactions when it is propagated to other peers over acquaintances in a P2P MDBS. Descendent transactions are translations of the original global transaction based on mappings between attributes in two acquainted peers. We present a serializability theory for transactions in P2P MDBSs, and then a concurrency control protocol is proposed to ensure the global serializability of global histories by controlling the consistency over each single acquaintance. The correctness of the concurrency control protocol is proved by using the developed theory.
6

Gao, Shen. „Transaction logging and recovery on phase-change memory“. HKBU Institutional Repository, 2013. http://repository.hkbu.edu.hk/etd_ra/1549.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Sleat, Philip M. „A static, transaction based design methodology for hard real-time systems“. Thesis, City, University of London, 1991. http://openaccess.city.ac.uk/17414/.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
This thesis is concerned with the design and implementation stages of the development lifecycle of a class of systems known as hard real-time systems. Many of the existing methodologies are appropriate for meeting the functional requirements of this class of systems. However, it is proposed that these methodologies are not entirely appropriate for meeting the non-functional requirement of deadlines for work within these real-time systems. After discussing the concept of real-time systems and their characteristic requirements, this thesis proposes the use of a general transaction model of execution for the implementation of the system. Whereas traditional methodologies consider the system from the flow of data or control in the system, we consider the system from the viewpoint of the role of each shared data entity. A control dependency is implied between otherwise independent processes that make use of a shared data entity; our viewpoint is known as the data dependency viewpoint. This implied control dependency between independent processes, necessary to preserve the consistency of the entity in the face of concurrent access, is ignored during the design stages of other methodologies. In considering the role of each data entity, it is possible to generate other viewpoints, such as the dataflow through the processes, automatically. This however, is not considered in the work. This thesis describes a staged methodology for taking the requirements specification for a system and generating a design and implementation for that system. The methodology is intended to be more than a set of vague guidelines for implementation; a more rigid approach to the design and implementation stages is sought. The methodology begins by decomposing the system into more manageable units of processing. These units are known as tasks with a very low degree of coupling and high degree of cohesion. Following the system decomposition, the data dependency viewpoint is constructed; a descriptive notation and CASE tool support this viewpoint. From this viewpoint, implementation issues such as generating control flow; task and data allocation and hard real-time scheduling concerns, are addressed. A complete runtime environment to support the transaction model is described. This environment is hierarchical and can be adapted to many distributed implementations. Finally, the stages of the methodology are applied to a large example, a Ship Control System. Starting with a specification of the requirements, the methodology is applied to generate a design and implementation of the system.
8

Chen, Jianwen. „Data and knowledge transaction in mobile environments“. Thesis, View thesis, 2004. http://handle.uws.edu.au:8081/1959.7/806.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Advances in wireless networking technology have engendered a new paradigm of computing, called mobile computing; in which users carrying portable devices have access to a shared infrastructure independent of their physical location. Mobile computing has matured rapidly as a field of computer science. In environments of mobile computing, the mobility and disconnection of portable computing devices introduce many new challenging problems that have never been encountered in conventional computer networks. New research issues combine different areas of computer science: networking, operating systems, data and knowledge management, and databases. This thesis studies data and knowledge transaction in mobile environments. To study transaction processing at the fundamental and theoretical level in mobile environments, a range of classical notions and protocols of transaction processing are rechecked and redefined in this thesis, and form the foundation for studying transaction processing in mobile environments. A criterion for mobile serial history is given and two new concurrency theorems are proved in mobile environments. In addition to data transaction, this thesis explores knowledge transaction in mobile environments. To study knowledge transaction in mobile environments this thesis presents and formalizes a knowledge transaction language and model for use in mobile computing environments. The thesis further formalizes a framework/model for a mobile logic programming multi-agent system which can be used to study knowledge transaction in multi-agent systems in mobile environments and is a very early effort towards a formal study of knowledge base and intelligent agents in mobile environments. This work provides a foundation for the formal specification and development of real-world mobile software systems, in the same way as traditional software systems have developed.
9

Dwyer, Barry. „Automatic design of batch processing systems“. Title page, abstract, table of contents and introduction only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phd993.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Gin, Andrew. „Building a Secure Short Duration Transaction Network“. Thesis, University of Canterbury. Computer Science and Software Engineering, 2007. http://hdl.handle.net/10092/1188.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
The objective of this project was to design and test a secure IP-based architecture suitable for short duration transactions. This included the development of a prototype test-bed in which various operating scenarios (such as cryptographic options, various IP-based architectures and fault tolerance) were demonstrated. A solution based on SIP secured with TLS was tested on two IP based architectures. Total time, CPU time and heap usage was measured for each architecture and encryption scheme to examine the viability of such a solution. The results showed that the proposed solution stack was able to complete transactions in reasonable time and was able to recover from transaction processor failure. This research has demonstrated a possible architecture and protocol stack suitable for IP-based transaction networks. The benefits of an IP-based transaction network include reduced operating costs for network providers and clients, as shared IP infrastructure is used, instead of maintaining a separate IP and X.25 network.
Mehr Quellen

Bücher zum Thema "Transaction systems (Computer systems)":

1

Krishnamurthy, E. V. Transaction processing systems. New York: Prentice Hall, 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Breitbart, Y. Overview of multidatabase transaction management. Stanford, Calif: Stanford University, Dept. of Computer Science, 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Rayns, Chris. IBM CICS Explorer. 2. Aufl. [Poughkeepsie, NY: IBM Corp., International Technical Support Organization], 2010.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Mock, M. Implementing atomic objects with the RelaX transaction facility. (Dublin): Trinity College Dublin, 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Claybrook, Billy G. OLTP, online transaction processing systems. New York: J. Wiley, 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Soparkar, Nandit R. Time-constrained transaction management: Real-time constraints in database transaction systems. Boston: Kluwer, 1996.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Martin, R. Jason. Transaction processing facility: A guide for application programmers. Englewood Cliffs, N.J: Yourdon Press, 1990.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Credle, Rufus. The complete guide to CICS transaction gateway: Configuration and administration. Poughkeepsie, NY: IBM Corp., International Technical Support Organization, 2014.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Sushil, Jajodia, und Kerschberg Larry, Hrsg. Advanced transaction models and architectures. Boston: Kluwer Academic Publishers, 1997.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Primatesta, Fulvio. TUXEDO, an open approach to OLTP. London: Prentice Hall, 1995.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Transaction systems (Computer systems)":

1

DevirmiŞ, TimuÇin, und özgür Ulusoy. „A transaction model for multidatabase systems“. In Lecture Notes in Computer Science, 862–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0024787.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Wang, Jiahong, Jie Li und Hisao Kameda. „Scheduling algorithms for parallel transaction processing systems“. In Lecture Notes in Computer Science, 283–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63371-5_29.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Larkin, Eugene, Alexey Ivutin, Alexander Novikov und Anna Troshina. „Transaction Flows in Multi-agent Swarm Systems“. In Lecture Notes in Computer Science, 43–52. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-93818-9_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Wietrzyk, Vlad Ingar, und Venkat Ramaswamy. „Real-time transaction scheduling in database systems“. In Lecture Notes in Computer Science, 633–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0034717.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Zhang, Youhui, Liu Dong, Gu Yu und Dongsheng Wang. „Exploring Design Space Using Transaction Level Models“. In Advances in Computer Systems Architecture, 589–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11572961_48.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Soparkar, Nandit, Henry F. Korth und Avi Silberschatz. „Autonomous Transaction Managers in Responsive Computing“. In Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems, 167–86. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2271-3_9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Awan, Malik Khurram, und Agostino Cortesi. „Blockchain Transaction Analysis Using Dominant Sets“. In Computer Information Systems and Industrial Management, 229–39. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59105-6_20.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Türker, Can, Kerstin Schwarz und Gunter Saake. „Global Transaction Termination Rules in Composite Database Systems“. In Lecture Notes in Computer Science, 122–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45033-5_9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Günthör, Roger, und Stefan Jablonski. „Transaction-based application integration in workflow management systems“. In Lecture Notes in Computer Science, 456–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0034701.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Findenig, Rainer, Thomas Leitner und Wolfgang Ecker. „Transaction-Level Modeling and Refinement Using State Charts“. In Computer Aided Systems Theory - EUROCAST 2013, 134–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-53856-8_17.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Transaction systems (Computer systems)":

1

Damoah, Dominic, James B. Hayfron-Acquah, Shamo Sebastian, Edward Ansong, Brighter Agyemang und Roy Villafane. „Transaction recovery in federated distributed database systems“. In 2014 International Conference on Computer Communication & Systems (ICCCS). IEEE, 2014. http://dx.doi.org/10.1109/icccs.2014.7068178.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Pop, Eugen, Mihnea Alexandru Moisescu und Ioan Stefan Sacala. „A Cyber-Physical Systems Oriented Transaction Platform“. In 2017 21st International Conference on Control Systems and Computer Science (CSCS). IEEE, 2017. http://dx.doi.org/10.1109/cscs.2017.76.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Hunka, Frantisek, und Roman Belunek. „Transaction Based Business Process Modeling“. In 2015 Federated Conference on Computer Science and Information Systems. IEEE, 2015. http://dx.doi.org/10.15439/2015f149.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Darwish, Saad M., Shawkat K. Guirguis und Mahmoud M. Ghozlan. „Intrusion detection in role administrated database: Transaction-based approach“. In 2013 8th International Conference on Computer Engineering & Systems (ICCES). IEEE, 2013. http://dx.doi.org/10.1109/icces.2013.6707175.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Hayden, R., und J. T. Bradley. „Shared Transaction Markov Chains for fluid analysis of massively parallel systems“. In amp; Simulation of Computer and Telecommunication Systems (MASCOTS). IEEE, 2009. http://dx.doi.org/10.1109/mascot.2009.5367050.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Haetzer, Bastian, und Martin Radetzki. „Asynchronous parallel simulation with transaction events“. In 2014 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XIV). IEEE, 2014. http://dx.doi.org/10.1109/samos.2014.6893217.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Gundebahar, Mucahit, und Sinem Zeynep Bastas. „Periodic transaction processing architecture with high performance in financial systems“. In 2013 International Conference on Technological Advances in Electrical, Electronics and Computer Engineering (TAEECE). IEEE, 2013. http://dx.doi.org/10.1109/taeece.2013.6557303.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Nair, Srijit, Sunil Kumar Khatri und Himanshu Gupta. „A Model to Enhance Security Of Digital Transaction“. In 2019 4th International Conference on Information Systems and Computer Networks (ISCON). IEEE, 2019. http://dx.doi.org/10.1109/iscon47742.2019.9036225.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Zhou, Bo, Linfeng Wang, Ning Xu, Nan Xu, Hongshan Zhang, Yanan Wang und Suhang Yao. „Application of blockchain technology in smarter energy transaction“. In International Conference on Intelligent Systems, Communications, and Computer Networks (ISCCN 2022), herausgegeben von Tok Wang Ling. SPIE, 2022. http://dx.doi.org/10.1117/12.2652521.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Ueno, Yutaro, und Masaomi Kimura. „Transaction Item Embedding by Maximizing A Joint Probability“. In 2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS). IEEE, 2019. http://dx.doi.org/10.1109/ccoms.2019.8821745.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Transaction systems (Computer systems)":

1

Khandelia, Mukul, und Shuvra S. Bhattacharyya. Contention-Conscious Transaction Ordering in Embedded Multiprocessors Systems. Fort Belvoir, VA: Defense Technical Information Center, März 2000. http://dx.doi.org/10.21236/ada457629.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Abbott, Russell, und Scott Cannon. Adaptive Computer Systems. Fort Belvoir, VA: Defense Technical Information Center, Januar 2002. http://dx.doi.org/10.21236/ada436050.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

SECRETARY OF THE AIR FORCE WASHINGTON DC. Computer Systems Management. Fort Belvoir, VA: Defense Technical Information Center, Februar 2001. http://dx.doi.org/10.21236/ada405169.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Costich, Oliver, und Sushil Jajodia. Maintaining Multilevel Transaction Atomicity in MLS Database Systems with Kernelized Architecture. Fort Belvoir, VA: Defense Technical Information Center, Januar 1993. http://dx.doi.org/10.21236/ada465420.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Forrest, Stephanie. Automated Diversity in Computer Systems. Fort Belvoir, VA: Defense Technical Information Center, September 2005. http://dx.doi.org/10.21236/ada439916.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Haley, Cornelius J., Steven M. LaFountain, Holly M. Traxler, Dixie B. Baker und R. Brown. Gould, Inc. Computer Systems Division. Fort Belvoir, VA: Defense Technical Information Center, Dezember 1986. http://dx.doi.org/10.21236/ada208006.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Steinauer, Dennis D. Security of personal computer systems. Gaithersburg, MD: National Bureau of Standards, 1985. http://dx.doi.org/10.6028/nbs.sp.500-120.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Payne, Jerome F. Recapitalization of Tactical Computer Automation Systems. Fort Belvoir, VA: Defense Technical Information Center, April 2002. http://dx.doi.org/10.21236/ada404333.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Satran, J., K. Meth, C. Sapuntzakis, M. Chadalapaka und E. Zeidner. Internet Small Computer Systems Interface (iSCSI). RFC Editor, April 2004. http://dx.doi.org/10.17487/rfc3720.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Andriole, S. Computer-Aided Systems Engineering. Version 01.00.00. Fort Belvoir, VA: Defense Technical Information Center, Juni 1994. http://dx.doi.org/10.21236/ada283230.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zur Bibliographie