Home »
Academic Articles & Research Papers
Showing 20 of 280 academic articles
A. V. Fursikov • Translations of mathematical monographs
(1999)
The existence of solutions to optimal control problems Optimality system for optimal control problems The solvability of boundary value problems for a dense set of data The problem of work minimization in accelerating still fluid to a presc...
OPENALEX
DOI: https://doi.org/10.1090/mmono/187
Sameer Ajmani, Barbara H. Liskov, Liuba Shrira • Lecture notes in computer science
(2006)
OPENALEX
DOI: https://doi.org/10.1007/11785477_26
Sape J. Mullender • ACM Press/Addison-Wesley Publishing Co. eBooks
(1993)
OPENALEX
Sukumar Ghosh • Chapman & Hall/CRC eBooks
(2006)
Most applications in distributed computing center around a set of common subproblems. Distributed Systems: An Algorithmic Approach presents the algorithmic issues and necessary background theory that are needed to properly understand these ...
OPENALEX
DOI: https://doi.org/10.1201/9781420010848
M. Amouroux, A. El Jai, El Hassan Zerrik • International Journal of Systems Science
(1994)
The aim of this paper is to develop the concept of regional observability for distributed systems. This original concept is closer to practical considerations since it only requires the observation of the state on a given subregion. We show...
OPENALEX
DOI: https://doi.org/10.1080/00207729408928961
Butler Lampson, Marmita Paul, Hans-Jürgen Siegert (1981)
1. Motivations, objectives and characterization of distributed systems.- 2. Distributed system architecture model.- 3. Interprocess communication layer: Introduction.- 4. Hardware interconnection technology.- 5. Link level.- 6. Hierarchy.- ...
OPENALEX
Ngoc Thanh Nguyên • Information Sciences
(2002)
OPENALEX
DOI: https://doi.org/10.1016/s0020-0255(02)00260-8
Butler Lampson, Martı́n Abadi, Michael T. Burrows, Edward P. Wobber • ACM SIGOPS Operating Systems Review
(1991)
We describe a theory of authentication and a system that implements it. Our theory is based on the notion of principal and a "speaks for" relation between principals. A simple principal either has a name or is a communication channel; a com...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/121132.121160
Morris S. Sloman, Jorge Lobo, Emil Lupu • Lecture notes in computer science
(2001)
OPENALEX
DOI: https://doi.org/10.1007/3-540-44569-2
Wen-Ke Chen, Matti A. Hiltunen, Richard D. Schlichting • Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems
(2002)
Adaptive software that can react to changes in the execution environment or user requirements by switching algorithms at run time is powerful yet difficult to implement, especially in distributed systems. This paper describes a software arc...
OPENALEX
DOI: https://doi.org/10.1109/icdsc.2001.918994
Wan J. Fokkink • Springer eBooks
(2007)
OPENALEX
DOI: https://doi.org/10.1007/978-3-540-73938-8
Gérard Le Lann (1977)
OPENALEX
other-oa
Ioannis Georgiadis, Jeff Magee, Jeff Kramer • Workshop on Self-healing systems
(2002)
A self-organising software architecture is one in which components automatically configure their interaction in a way that is compatible with an overall architectural specification. The objective is to minimise the degree of explicit manage...
OPENALEX
DOI: https://doi.org/10.1145/582128.582135
Audun Jøsang • New Security Paradigms Workshop
(1996)
Research in information security has traditionally focused on where to place or how to propagate trust.In that sense, a cyptographic algorithm or protocol is simply a mechanism to transfer trust from where it exists to where it is needed.Th...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/304851.304877
Michel Raynal, Mukesh Singhal • Computer
(1996)
Causality is vital in distributed computations. Distributed systems can determine causality using logical clocks. Human beings use the concept of causality to plan, schedule, and execute an enterprise, or to determine a plan's feasibility. ...
OPENALEX
DOI: https://doi.org/10.1109/2.485846
Hesham El‐Rewini, Theodore Gyle Lewis, Hesham Ali (1994)
1. Resource Allocation: A Classical Problem. 2. The General Model. 3. Optimal Scheduling Algorithms. 4. The Relationship Between Matching and Two-Processor Scheduling. 5. Static Scheduling Heuristics. 6. SPMD Model. 7. Dynamic Task Allocati...
OPENALEX
Tad Hogg, Bernardo A. Huberman • IEEE Transactions on Systems Man and Cybernetics
(1991)
A simple and robust procedure for freezing out chaotic behavior in systems composed of interacting agents making decisions based on imperfect and delayed information is described. It is based on a reward mechanism whereby the relative numbe...
OPENALEX
DOI: https://doi.org/10.1109/21.135679
Shmuel M. Katz • ACM Transactions on Programming Languages and Systems
(1993)
article Free Access Share on A superimposition control construct for distributed systems Author: Shmuel Katz Technion–Israel Institute of Technology, Haifa, Israel Technion–Israel Institute of Technology, Haifa, IsraelView Profile Authors I...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/169701.169682
Waseem Ahmed, Yong Wei Wu • Journal of Computer and System Sciences
(2013)
OPENALEX
Open Access
DOI: https://doi.org/10.1016/j.jcss.2013.02.006
Marc Shapiro (1986)
We present a novel view of the structuring of distributed systems, and a few examples of its utilization in an object-oriented context. In a distributed system, the structure of a service or subsystem may be complex, being implemented as a ...
OPENALEX
Open Access