Zobrazeno 1 - 10
of 132
pro vyhledávání: '"A. Ejnioui"'
Publikováno v:
International Journal of Dependable and Trustworthy Information Systems. 2:36-54
In an era where dependence of information systems is significantly high, the threat of incidents related to information security that could jeopardize the information held by is becoming critical. Alarming facts within the literature point to inadequ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::baa9c0b4f2ce6372d6dee6404a85c570
https://doi.org/10.4018/jdtis.2011070103
https://doi.org/10.4018/jdtis.2011070103
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 18:1529-1538
The Tiered Algorithm is presented for time-efficient and message-efficient detection of process termination. It employs a global invariant of equality between process production and consumption at each level of process nesting to detect termination,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f8b11eb75f7a8e7378509e0d3786eb3
https://doi.org/10.1109/tpds.2007.1066
https://doi.org/10.1109/tpds.2007.1066
Publikováno v:
NATW
Self-reliance capabilities of mission-critical systems gain importance as technology scaling and logic capacity of SRAM-based reconfigurable devices increase. The Sustainable Modular Adaptive Redundancy Technique (SMART) is evaluated to optimize the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c51480ea3acad5d2296cda12e6966b01
https://doi.org/10.1109/natw.2015.14
https://doi.org/10.1109/natw.2015.14
Publikováno v:
Scopus-Elsevier
Performance metrics and evaluation criteria are used to develop a novel taxonomy that classifies barrier mechanisms into categories ranging from simple Static-Binding Idle-Tasking methods to robust Dynamic-Binding Any-Tasking methods. Such capabiliti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac62f9fdff4d224e9d82b82e0842db72
https://doi.org/10.1080/1206212x.2006.11441820
https://doi.org/10.1080/1206212x.2006.11441820
Autor:
A. Ejnioui, Nagarajan Ranganathan
Publikováno v:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 11:283-287
In this paper, we address the problem of routing nets on field programmable gate arrays (FPGAs) interconnected by a switch matrix. We extend the switch matrix architecture proposed by Zhu et al. (1993) to route nets between FPGA chips in a multi-FPGA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e968146ca48c04330291f128b06634fc
https://doi.org/10.1109/tvlsi.2003.810778
https://doi.org/10.1109/tvlsi.2003.810778
Autor:
A. Ejnioui, Nagarajan Ranganathan
Publikováno v:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 11:71-78
Multi-FPGA (field-programmable gate arrays) systems are used as custom computing machines to solve compute-intensive problems and also in the verification and prototyping of large circuits. In this paper, we address the problem of routing multitermin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f551233fad9da65c59cd3ce6b2ed832
https://doi.org/10.1109/tvlsi.2002.800523
https://doi.org/10.1109/tvlsi.2002.800523
Autor:
N. Ranganathan, A. Ejnioui
Publikováno v:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 9:407-410
Reconfigurable single-chip emulation systems were proposed as an alternative to multichip emulation systems. Because they cannot be emulated on a single chip at once, large designs are sliced into partitions that are downloaded and executed sequentia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a02c59ae4ce02cd626afa55e3241c434
https://doi.org/10.1109/92.924064
https://doi.org/10.1109/92.924064
Publikováno v:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 7:277-280
Tree matching is an important problem used for three-dimensional object recognition in image understanding and vision systems. The objective of tree matching is to find the set of nodes at which a pattern tree matches a subject tree. In this paper, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18b43917ab332f22639aa91229164fb2
https://doi.org/10.1109/92.766755
https://doi.org/10.1109/92.766755
Publikováno v:
2013 IEEE Conference on Open Systems (ICOS).
Recently, sequence diagrams have been extended with the introduction of a set of operators in the latest specification of the Unified Modeling Language 2 (UML 2). Embedded in combined fragments, these operators are intended to simplify the diagram's
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::686c6d07c81e5ecddcc56098ac5a27a8
https://doi.org/10.1109/icos.2013.6735057
https://doi.org/10.1109/icos.2013.6735057
Publikováno v:
RIIT
The latest specification of the Unified Modeling Language (UML) 2.x revised completely the structure and elements of sequence diagrams by expanding their modularity via interaction fragments. These fragments are based on a set of operators that can s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2203fd0d129c7f0d54b7ad14ed2f4ebc
https://doi.org/10.1145/2512209.2512211
https://doi.org/10.1145/2512209.2512211