What Is an Operating System? A Historical Investigation (1954–1964)

Bullynck, Maarten

doi:10.1007/978-3-319-97226-8_3

Cited by 18 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the 1960s, the turn from user-driven software to manufacturer's software made the concept of an OS viable, gradually making OS a part of the computer's system structure as the actual hardware. Most computers were designed to be rented or sold with an OS so that customers would be able to write their own applications or contract vendors to develop according to their needs, giving birth to a whole new software industry [80]. Today, we cannot imagine using a computer without an OS.…”

Section: Operating Systems: a Historical Perspective From "No Os" To ...mentioning

confidence: 99%

From Standard Policy-Based Zero Trust to Absolute Zero Trust (AZT): A Quantum Leap to Q-Day Security

Raheman

2024

JCC

View full text Add to dashboard Cite

Cybercrime is projected to cost a whopping $23.8 Trillion by 2027. This is essentially because there's no computer network that's not vulnerable. Fool-proof cybersecurity of personal data in a connected computer is considered practically impossible. The advent of quantum computers (QC) will worsen cybersecurity. QC will be a boon for data-intensive industries by drastically reducing the computing time from years to minutes. But QC will render our current cryptography vulnerable to quantum attacks, breaking nearly all modern cryptographic systems. Before QCs with sufficient qubits arrive, we must be ready with quantum-safe strategies to protect our ICT infrastructures. Postquantum cryptography (PQC) is being aggressively pursued worldwide as a defence from the potential Q-day threat. NIST (National Institute of Standards and Technology), in a rigorous process, tested 82 PQC schemes, 80 of which failed after the final round in 2022. Recently the remaining two PQCs were also cracked by a Swedish and a French team of cryptographers, placing NIST's PQC standardization process in serious jeopardy. With all the NISTevaluated PQCs failing, there's an urgent need to explore alternate strategies. Although cybersecurity heavily relies on cryptography, recent evidence indicates that it can indeed transcend beyond encryption using Zero Vulnerability Computing (ZVC) technology. ZVC is an encryption-agnostic absolute zero trust (AZT) approach that can potentially render computers quantum resistant by banning all third-party permissions, a root cause of most vulnerabilities. Unachievable in legacy systems, AZT is pursued by an experienced consortium of European partners to build compact, solid-state devices that are robust, resilient, energy-efficient, and with zero attack surface, rendering them resistant to malware and future Q-Day threats.How to cite this paper: Raheman, F.

show abstract

Section: Operating Systems: a Historical Perspective From "No Os" To ...mentioning

confidence: 99%

From Standard Policy-Based Zero Trust to Absolute Zero Trust (AZT): A Quantum Leap to Q-Day Security

Raheman

2024

JCC

View full text Add to dashboard Cite

show abstract

“…It plays a critical role in daily operations carried out in most organizations in different business fields. Data batch processing can be defined as the execution of data files as input batches using the available resources and gather the resulted files as output batches while satisfying files priorities, predecessors constraints, and time constraints [3,4]. The execution is carried out on the mainframe computer that runs at a scheduled time or on an as-needed basis without user interaction and minimal or no interaction with a computer operator [3,4].…”

Section: Introductionmentioning

confidence: 99%

Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain

2021

View full text Add to dashboard Cite

The financial data supply chain is vital to the economy, especially for banks. It affects their customer service level, therefore, it is crucial to manage the scheduling of the financial data supply chain to elevate the efficiency of banking sectors’ performance. The primary tool used in the data supply chain is data batch processing which requires efficient scheduling. This work investigates the problem of scheduling the processing of tasks with non-identical sizes and different priorities on a set of parallel processors. An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. The objective is to minimize different cost types while satisfying constraints such as resources availability, customer service level, and tasks dependency relation. The algorithm proved its effectiveness by allocating tasks with higher priority and weight while taking into consideration customers’ Service Level Agreement, time, and different types of costs, which led to a lower total cost of the batching process. The developed algorithm proved effective by testing it on an illustrative network. Also, a sensitivity analysis is conducted by varying the model parameters for networks with different sizes and complexities to study their impact on the total cost and the problem under study.

show abstract