Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "concurrency control" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
SXCCP+: Simple XML Concurrency Control Protocol for XML Database Systems
Autorzy:
Jankiewicz, K.
Powiązania:
https://bibliotekanauki.pl/articles/970819.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
concurrency control
XML
databases
protocols
Opis:
Increasing significance and popularity of XML is the main reason why many commercial object-relational database management systems (ORDBMSs) developed XML storage and processing functionality. Additionally, there are new types of specialized database systems known as 'native' XML database systems. As we know, concurrency control is one of the most important mechanisms in DBMSs. Unfortunately, concurrency control mechanisms, which have been used so far in commercially available native XML DBMSs, offer very low degree of concurrency. The development of universal and effective concurrency control protocol for accessing XML data, with high degree of concurrency, is a necessary condition of the native XML database growth. The aim of this paper is to propose a new concurrency control protocol in XML document access. This protocol is based on primitive operations, which can be treated as a unification platform for any of the XML access methods.
Źródło:
Control and Cybernetics; 2009, 38, 1; 215-237
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Transaction mechanisms in complex business processes
Autorzy:
Jankiewicz, K.
Kujawiński, K.
Mor, M.
Morzy, T.
Powiązania:
https://bibliotekanauki.pl/articles/206063.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
SOA
transactions
business processes
concurrency control
automacity
compensation
Opis:
The importance of systems based on the SOA architecture continues to grow. At the same time, in spite of the existence of many specifications which allow for the coordination of business processes functioning in the SOA environment, there is still lack of solutions that allow the use of system mechanisms of transaction processing. Such solutions should entail the simplification of construction of business processes without affecting their capabilities. This article presents a Transaction Coordinator environment, designed and implemented as a response to these needs.
Źródło:
Control and Cybernetics; 2011, 40, 3; 605-625
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Elimination of task starvation in conflictless scheduling concept
Autorzy:
Smoliński, M.
Powiązania:
https://bibliotekanauki.pl/articles/94909.pdf
Data publikacji:
2016
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
resource conflict elimination
conflict free task schedule
deadlock avoidance
concurrency control
mutual exclusion
transaction processing
OLTP
Opis:
New concept of conflictless task scheduling is an alternative approach to existing solutions in concurrency. Conflictless task scheduling includes data structures and algorithm that prevents occurrence of resource conflict between tasks executed in parallel. The range of applications the conflictless task scheduling includes different environments like transactions processing in database management systems, scheduling of processes or threads in operating systems or business processes management. Task scheduling without any resource conflicts is dedicated to high contention of limited resources environments and its algorithm can be implemented in modern GPU. This paper presents concept of local task scheduling without resources conflicts occurrence, discusses features of new approach and focuses on problem of task starvation. Elimination of task starvation is included in conflictless task scheduling concept, detailed explanation are contained in this paper.
Źródło:
Information Systems in Management; 2016, 5, 2; 237-247
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The GPU performance in coordination of parallel tasks in access to resource groups without conflicts
Autorzy:
Smoliński, M.
Powiązania:
https://bibliotekanauki.pl/articles/94883.pdf
Data publikacji:
2017
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
resource conflict elimination
conflict free task execution
mutual exclusion
deadlock avoidance
cooperative concurrency control
GPU massively parallel processing
SIMD control SISD
GPGPU using OpenCL
Opis:
In high contention environments, with limited number of shared resources, elimination of resource conflicts between tasks processed in parallel is required. Execution of all tasks without resource conflicts can be achieved by preparing a proper overall schedule for all of them. The effective calculation of conflict-free execution plan for tasks provides the conflictless scheduling algorithm that is dedicated to GPU massively parallel processing. The conflictless scheduling algorithm base on rapid resource conflict detection to mutual exclusion of conflicted tasks in access to global resources and is an alternative to other task synchronization methods. This article presents the performance of modern GPU in calculations of adaptive conflictless task schedule. The performance analysis also takes into account all data transfers to and from the GPU memory in various phases of the conflictless task scheduling algorithm.
Źródło:
Information Systems in Management; 2017, 6, 2; 143-153
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Problems of Transition Predicates Construction in Hierarchical Concurrent Controllers
Autorzy:
Łabiak, G.
Powiązania:
https://bibliotekanauki.pl/articles/226340.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
binary control system
statechart diagrams
hierarchy;concurrency
conflicting transitions
Boolean predicates
computational complexity
compatibility classes
clique problem
Opis:
The paper presents a problem of a transition predicates construction in hierarchical concurrent state oriented notation. The notation, called statechart diagrams or state machine, serves as a very convenient formalism for specification of a complex behavior of the embedded systems control unit. The controller specified in this way is discrete, deterministic and synchronous system which operates on binary values and can be implemented in programmable devices as a digital circuit. Well designed controller has conflict-free transitions and its concurrent transitions should be independent. In order to meet this requirements transition predicates must be pairwise both orthogonal and non-implicative. Computational complexities of the problems is equal to classic clique problem. The paper also suggests some statecharts syntactic structures solving these problems.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 411-418
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies