Reset
Showing 20 of 528 academic articles

Quantum computing

Gilles Brassard • ACM SIGACT News (1994)

article Free Access Share on Quantum computing: the end of classical cryptography? Author: Gilles Brassard View Profile Authors Info & Claims ACM SIGACT NewsVolume 25Issue 4Dec. 1994 pp 15–21https://doi.org/10.1145/190616.190617Published:01...

OPENALEX DOI: https://doi.org/10.1145/190616.190617

Introduction to Quantum Computing

V. Padmavathi, C. N. Sujatha, Vedula Sitharamulu, K. S. Reddy et al. • Wiley eBooks (2023)

Over the past few decades, tremendous growth has been witnessed in cryptography in which different security techniques and concerns were projected and put into practice. The classical methods of cryptography are depended on binary bits, whi...

OPENALEX DOI: https://doi.org/10.1002/9781119905172.ch1

Demonstration of Blind Quantum Computing

Stefanie Barz, Elham Kashefi, Anne Broadbent, Joseph F. Fitzsimons et al. • Science (2012)

Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and out...

OPENALEX Open Access DOI: https://doi.org/10.1126/science.1214707

Concurrent robust checkpointing and recovery in distributed systems

Pei-Jyun Leu, Bharat Bhargava • IEEE International Conference on Data Engineering (ICDE) (2003)

A checkpoint/rollback algorithm is presented for multiple processes in a distributed system that uses message passing for communication. Each process in the system can initiate the algorithm autonomously. If only one instance of the algorit...

OPENALEX DOI: https://doi.org/10.1109/icde.1988.105457

On coordinated checkpointing in distributed systems

Guohong Cao, Mukesh Singhal • IEEE Transactions on Parallel and Distributed Systems (1998)

Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, the approach suffers from high overhead associated with the che...

OPENALEX DOI: https://doi.org/10.1109/71.737697

On Deadlock Detection in Distributed Systems

Virgil D. Gligor, S.H. Shattuck • IEEE Transactions on Software Engineering (1980)

A hierarchically organized and a distributed protocol for deadlock detection in distributed databases are presented in [1]. In this paper we show that the distributed protocol is incorrect, and present possible remedies. However, the distri...

OPENALEX DOI: https://doi.org/10.1109/tse.1980.230491

DISTRIBUTED SYSTEM-A TOOL FOR BUILDING DEPENDABLE DISTRIBUTED SYSTEM

Prof. Ravish Kumar Mishra Dr. JaiPrakash Sirur • Zenodo (CERN European Organization for Nuclear Research) (2012)

Physically, a Distributed System consists of a set of processors, with a collection of local storage mechanisms associated with each processor. A processor is able to execute programs that access and manipulate the local storage, where the ...

OPENALEX cc-by DOI: https://doi.org/10.5281/zenodo.7116348

Distributed Systems

Vivek S Kale • CRC Press eBooks (2018)

The origins of big data technologies come from database systems and distributed systems as well as data mining and machine learning algorithms that can process these vast amounts of data to extract the necessary knowledge. This chapter addr...

OPENALEX DOI: https://doi.org/10.1201/9780429453311-9

A framework for event composition in distributed systems

Peter R. Pietzuch, Brian Ninham Shand, Jean Bacon • Lecture notes in computer science (2003)

1 Introduction Event-based communication has become a new paradigm for building large-scaledistributed systems. It has the advantages of loosely coupling communication partners, being extremely scalable, and providing a simple application p...

OPENALEX DOI: https://doi.org/10.5555/1515915.1515921

Pegasus: A Framework for Mapping Complex Scientific Workflows onto Distributed Systems

Ewa Deelman, Gurmeet Singh, Mei-Hui Su, James Blythe et al. • Scientific Programming (2005)

This paper describes the Pegasus framework that can be used to map complex scientific workflows onto distributed resources. Pegasus enables users to represent the workflows at an abstract level without needing to worry about the particulars...

OPENALEX cc-by DOI: https://doi.org/10.1155/2005/128026

Detection of Mutual Inconsistency in Distributed Systems

D. Stott Parker, Gerald J. Popek, G. Rudisin, Alley Stoughton et al. • IEEE Transactions on Software Engineering (1983)

Many distributed systems are now being developed to provide users with convenient access to data via some kind of communications network. In many cases it is desirable to keep the system functioning even when it is partitioned by network fa...

OPENALEX DOI: https://doi.org/10.1109/tse.1983.236733

Replica control in distributed systems

Calton Pu, Avraham Leff • ACM SIGMOD International Conference on Management of Data (SIGMOD) (1991)

Article Free Access Share on Replica control in distributed systems: as asynchronous approach Authors: Calton Pu Department of Computer Science, Columbia University, New York, NY Department of Computer Science, Columbia University, New York...

OPENALEX DOI: https://doi.org/10.1145/115790.115856