Matches in SemOpenAlex for { <https://semopenalex.org/work/W4287263721> ?p ?o ?g. }
Showing items 1 to 49 of
49
with 100 items per page.
- W4287263721 abstract "Recently, we have introduced two graph-decomposition theorems based on a new graph product (the vertex-removing synchronised product (VRSP)), motivated by applications in the context of synchronising periodic real-time processes. In these applications, periodic real-time processes synchronise over actions that have the same label and therefore the same behaviour. From a process-algebraic point of view, such a synchronising action is executed atomically and at the same time by all processes that have this action in their alphabet. But, when these processes are executed on some computer platform, synchronisation leads to context switches of the processes and therefore an increased overhead, which may lead to deadline misses. But, by combining processes we reduce the number of context switches and therefore reduce the overhead. We combine these processes by representing the processes by edge-labelled acyclic directed multi-graphs, and multiply the graphs by the VRSP. Next, we transpose the resulting graphs into processes for which there are less context switches. An important aspect of these real-time applications is that they must execute in time. Still, it may happen that the set of processes of the application cannot execute timely and may miss a deadline. Now, by decomposing the graphs and multiplying the graphs by the VRSP in another combination, the processes that are represented by these recombined graphs may execute in time. The requirements of the recently introduced graph-decomposition theorems are too strict and can be relaxed, whereby more graphs can be decomposed giving more possible combinations for the real-time application. Therefore, we recall the definition of the VRSP and the two graph-decomposition theorems, we relax the requirements by stating and proving two lemmas and use these lemmas to state and prove these two (relaxed) graph-decomposition theorems." @default.
- W4287263721 created "2022-07-25" @default.
- W4287263721 creator A5085289736 @default.
- W4287263721 date "2021-03-19" @default.
- W4287263721 modified "2023-10-17" @default.
- W4287263721 title "A modification of two graph-decomposition theorems based on a vertex-removing synchronised graph product" @default.
- W4287263721 doi "https://doi.org/10.48550/arxiv.2103.10808" @default.
- W4287263721 hasPublicationYear "2021" @default.
- W4287263721 type Work @default.
- W4287263721 citedByCount "0" @default.
- W4287263721 crossrefType "posted-content" @default.
- W4287263721 hasAuthorship W4287263721A5085289736 @default.
- W4287263721 hasBestOaLocation W42872637211 @default.
- W4287263721 hasConcept C102192266 @default.
- W4287263721 hasConcept C132525143 @default.
- W4287263721 hasConcept C160446614 @default.
- W4287263721 hasConcept C187407849 @default.
- W4287263721 hasConcept C203776342 @default.
- W4287263721 hasConcept C41008148 @default.
- W4287263721 hasConcept C43517604 @default.
- W4287263721 hasConcept C68103157 @default.
- W4287263721 hasConcept C80444323 @default.
- W4287263721 hasConcept C80899671 @default.
- W4287263721 hasConceptScore W4287263721C102192266 @default.
- W4287263721 hasConceptScore W4287263721C132525143 @default.
- W4287263721 hasConceptScore W4287263721C160446614 @default.
- W4287263721 hasConceptScore W4287263721C187407849 @default.
- W4287263721 hasConceptScore W4287263721C203776342 @default.
- W4287263721 hasConceptScore W4287263721C41008148 @default.
- W4287263721 hasConceptScore W4287263721C43517604 @default.
- W4287263721 hasConceptScore W4287263721C68103157 @default.
- W4287263721 hasConceptScore W4287263721C80444323 @default.
- W4287263721 hasConceptScore W4287263721C80899671 @default.
- W4287263721 hasLocation W42872637211 @default.
- W4287263721 hasOpenAccess W4287263721 @default.
- W4287263721 hasPrimaryLocation W42872637211 @default.
- W4287263721 hasRelatedWork W1490784263 @default.
- W4287263721 hasRelatedWork W1566820354 @default.
- W4287263721 hasRelatedWork W1892973443 @default.
- W4287263721 hasRelatedWork W1989055678 @default.
- W4287263721 hasRelatedWork W2025565256 @default.
- W4287263721 hasRelatedWork W2144208319 @default.
- W4287263721 hasRelatedWork W2160284954 @default.
- W4287263721 hasRelatedWork W2949673630 @default.
- W4287263721 hasRelatedWork W4288294436 @default.
- W4287263721 hasRelatedWork W577041502 @default.
- W4287263721 isParatext "false" @default.
- W4287263721 isRetracted "false" @default.
- W4287263721 workType "article" @default.