Concurrency requires consistency and correctness. Isothetic rectangles can be used as a geometrical technique to verify a safe and deadlock free schedule for concurrent nodes. However, the known algorithms for concurrency using isothetic rectangles require the prior knowledge of the system behavior. We provide a new mechanism to use isothetic rectangles without this limitation. The discrete nature of isothetic rectangles provides an opportunity for inter-diagrammatic reasoning. Inter-Diagrammatic Reasoning (IDR) can be easily computed on a parallel machine, and has a complexity of O(n) for most of the iso-rectangles problems where the best known algorithm was O(n log n) in Euclidean geometry. This new framework will also allow dynamic mode of operation in calculating the closure of a set of iso-rectangles; rather than restricting the solution to static systems where all required resources must be reserved in advance.
%0 Journal Article
%1 citeulike:337703
%A El-Kafrawy, Passent
%A Mccartney, Robert
%D 2005
%J Knowledge-Based Systems
%K citeulike deadlock, deadlocks
%N 4-5
%P 179--186
%R 10.1016/j.knosys.2004.10.006
%T Reasoning with geometric information in digital space
%U http://dx.doi.org/10.1016/j.knosys.2004.10.006
%V 18
%X Concurrency requires consistency and correctness. Isothetic rectangles can be used as a geometrical technique to verify a safe and deadlock free schedule for concurrent nodes. However, the known algorithms for concurrency using isothetic rectangles require the prior knowledge of the system behavior. We provide a new mechanism to use isothetic rectangles without this limitation. The discrete nature of isothetic rectangles provides an opportunity for inter-diagrammatic reasoning. Inter-Diagrammatic Reasoning (IDR) can be easily computed on a parallel machine, and has a complexity of O(n) for most of the iso-rectangles problems where the best known algorithm was O(n log n) in Euclidean geometry. This new framework will also allow dynamic mode of operation in calculating the closure of a set of iso-rectangles; rather than restricting the solution to static systems where all required resources must be reserved in advance.
@article{citeulike:337703,
abstract = {{Concurrency requires consistency and correctness. Isothetic rectangles can be used as a geometrical technique to verify a safe and deadlock free schedule for concurrent nodes. However, the known algorithms for concurrency using isothetic rectangles require the prior knowledge of the system behavior. We provide a new mechanism to use isothetic rectangles without this limitation. The discrete nature of isothetic rectangles provides an opportunity for inter-diagrammatic reasoning. Inter-Diagrammatic Reasoning (IDR) can be easily computed on a parallel machine, and has a complexity of O(n) for most of the iso-rectangles problems where the best known algorithm was O(n log n) in Euclidean geometry. This new framework will also allow dynamic mode of operation in calculating the closure of a set of iso-rectangles; rather than restricting the solution to static systems where all required resources must be reserved in advance.}},
added-at = {2017-09-08T10:52:59.000+0200},
author = {El-Kafrawy, Passent and Mccartney, Robert},
biburl = {https://www.bibsonomy.org/bibtex/257477bb6b6710f2f4c9cb5c403ac0819/fernand0},
citeulike-article-id = {337703},
citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.knosys.2004.10.006},
citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V0P-4G98WRP-2/2/5f1b03e320971d14b2261bc6c6446163},
doi = {10.1016/j.knosys.2004.10.006},
interhash = {946868cbe5f58099d508b23a8cdb3cd8},
intrahash = {57477bb6b6710f2f4c9cb5c403ac0819},
journal = {Knowledge-Based Systems},
keywords = {citeulike deadlock, deadlocks},
month = aug,
number = {4-5},
pages = {179--186},
posted-at = {2005-09-30 18:51:41},
priority = {2},
timestamp = {2017-09-08T10:53:23.000+0200},
title = {{Reasoning with geometric information in digital space}},
url = {http://dx.doi.org/10.1016/j.knosys.2004.10.006},
volume = 18,
year = 2005
}