The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
IEEE Transactions on Dependable and Secure Computing
Abstract
We propose a new framework for the (length,reliability) bicriteria static multiprocessor scheduling problem.Our first criterion remains the schedule's length, crucial to assess the system's realtime property.For our second criterion, we consider the global system failure rate, seen as if the whole system were a single task scheduled onto a single processor, instead of the usual reliability, because it does not depend on the schedule length like the reliability does (due to its computation in the classical exponential distribution model).Therefore, we control better the replication factor of each individual task of the dependency task graph given as a specification, with respect to the desired failure rate.To solve this bicriteria optimization problem, we take the failure rate as a constraint, and we minimize the schedule length.We are thus able to produce, for a given dependency task graph and multiprocessor architecture, a Pareto curve of non-dominated solutions, among which the user can choose the compromise that fits his requirements best.Compared to the other bicriteria (length,reliability) scheduling algorithms found in the literature, the algorithm we present here is the first able to improve significantly the reliability, by several orders of magnitude, making it suitable to safety critical systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Basic concepts and taxonomy of dependable and secure computing
Avizienis, A., Laprie, J.-C., Randell, B., & Landwehr, C. (2004) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2004.2 · Cited by 5,223
An experimental evaluation of the assumption of independence in multiversion programming
Knight, J. C., & Leveson, N. G. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6312924 · Cited by 774
Reliable and Precise WCET Determination for a Real-Life Processor
Ferdinand, C., Heckmann, R., Langenbach, M., Martin, F., Schmidt, M., Theiling, H., Thesing, S., & Wilhelm, R. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45449-7_32 · Cited by 278
Doğan, A. (2005) · The Computer Journal · doi:10.1093/comjnl/bxh086 · Cited by 132
Cited by
The internet of things for smart manufacturing: A review
Yang, H., Kumara, S., Bukkapatnam, S. T. S., & Tsung, F. (2019) · IISE Transactions · doi:10.1080/24725854.2018.1555383 · Cited by 449
Bhushan, B., Khamparia, A., Sagayam, K. M., Sharma, S. K., Ahad, M. A., & Debnath, N. C. (2020) · Sustainable Cities and Society · doi:10.1016/j.scs.2020.102360 · Cited by 353
Lightweight Cryptography: A Solution to Secure IoT
Dhanda, S. S., Singh, B., & Jindal, P. (2020) · Wireless Personal Communications · doi:10.1007/s11277-020-07134-3 · Cited by 294
A comprehensive survey and taxonomy of the SVM-based intrusion detection systems
Mohammadi, M., Rashid, T. A., Karim, S. H. T., Aldalwie, A. H. M., Tho, Q. T., Bidaki, M., Rahmani, A. M., & Hosseinzadeh, M. (2021) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2021.102983 · Cited by 262
A survey of phishing attack techniques, defence mechanisms and open research challenges
Jain, A. K., & Gupta, B. B. (2022) · Enterprise Information Systems · doi:10.1080/17517575.2021.1896786 · Cited by 192
Metadata
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2026-09-02
- ISSN
- 1545-5971 (ISSN-L)
- 1941-0018
- 2160-9209
- OpenAlex
- W4206307994
- Cited by
- 309
- References
- 4
- Type
- paratext
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: IEEE Transactions on Dependable and Secure Computing. https://app.cochat.ai/papers/10.1109/tdsc.8858
- The paper
- IEEE Transactions on Dependable and Secure Computing. (2023). IEEE Transactions on Dependable and Secure Computing. https://doi.org/10.1109/tdsc.8858
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.