Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 2

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  mutual exclusion
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Publication available in full text mode
Content available

ELIMINATION OF TASK STARVATION IN CONFLICTLESS SCHEDULING CONCEPT

100%
Smoliński M.
Information Systems in Management
|
2016
|
vol. 5
|
issue 2
237-247
EN
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.
2
Publication available in full text mode
Content available

Mutual Exclusion in DSM Systems: A Protocol with Vectors of Timestamps; Demonstration of Control Flow by Cause/Effect Structures

100%
Czaja L.
Zeszyty Naukowe Uczelni Vistula
|
2016
|
issue 49(4) Informatyka
85-104
EN
A protocol based on vectors of timestamps and devised for mutual exclusion in Distributed Shared Memory (DSM) systems is presented. Its exampled behaviour is shown as a token game in the Cause/ Effect (C/E) structures model.
PL
Przedstawiono protokół oparty na wektorach znaczników czasu i zaprojektowany dla wzajemnego wykluczenia w systemach rozproszonej pamięci dzielonej (DSM). Jego przykładowe zachowanie jest ukazane jako gra z zastosowaniem żetonów w modelu struktur przyczynowo-skutkowych.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.