550 results on '"Distributed computer systems"'
Search Results
502. The forming of trust level to the nodes in the distributed computer systems.
- Author
-
Mukhin, Vadym, Bidkov, Anton, and Vu Duc Thinh
- Abstract
This paper described the approach to the forming of the trust level for the Distributed Computer Systems (DCS) nodes, based on the analyzing of the dynamics of the processed information value changing. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
503. Wisdom : the foundation of a scalable parallel operating system
- Author
-
Murray, Kevin
- Subjects
- 005, Distributed computer systems
- Published
- 1990
504. Exact transient analysis of a circulant queuing network
- Author
-
N. Selvaraju, P. R. Parthasarathy, and G. Manimaran
- Subjects
Differential equations ,Inverse problems ,Theoretical computer science ,Computer science ,Circulant matrix ,Matrix algebra ,Polynomials ,Transient analysis ,Semi-Markov process ,Modelling and Simulation ,Computer Science::Networking and Internet Architecture ,Circulants ,Transient (computer programming) ,Physics::Atmospheric and Oceanic Physics ,Probability ,Eigenvalues and eigenfunctions ,Mathematical models ,Problem solving ,Sojourn time ,Distributed query processing system ,Markov processes ,Queuing network ,Vectors ,Queuing networks ,Distributed computer systems ,Fourier transforms ,Algebra ,Computer Science::Performance ,Computational Mathematics ,Computational Theory and Mathematics ,Modeling and Simulation ,Queueing networks ,Sojourn times - Abstract
Circulant matrices possess unusual and interesting properties. These properties have been exploited to obtain the transient solution in closed form for a circulant queuing network that models a distributed query processing system. The sojourn time of a customer in the circulant queuing network is determined. A semi-Markov generalisation of this network is also studied.
- Full Text
- View/download PDF
505. Improving Information Storage Reliability Using a Data Network
- Author
-
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Benjamin, Arthur J, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, and Benjamin, Arthur J
- Abstract
Backup and recovery methods using magnetic tapes are common in computer utilities, since information stored on-line is subject to damage. The serial access nature of the tape medium severely restricts the flexibility and simplicity of accessing and managing the stored data. A method using a data network is described, to present a backup mechanism which takes advantage of a large, inexpensive, random access remote data storage facility to provide data access and management functions that are more flexible than those provided by a traditional backup facility. Although data transfer rates will be reduced, data access and management will be simplified, and system availability will be improved. The work described is based on a network backup facility built for the Multics computer utility, using the ARPAnet.
- Published
- 1976
506. Some Considerations and Models for the Distribution of a Data Base
- Author
-
TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES, Elam, Joyce, Stutz, Joel, TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES, Elam, Joyce, and Stutz, Joel
- Abstract
This paper presents a survey of current research in the area of distributed systems and discusses some possible areas of future research. The trend toward data base management systems which are responsible for the creation, accessing, and maintenance of a large collection of information containing complex interrelationships is prevalent in centralized systems today. It seems that the same advantages which led to the growth of data base management systems in centralized systems can be applied in distributed systems as well. Most current research (particularly in the area of modeling) views a distributed system in terms of independent data files. The authors address some of the problems involved when the distributed system is viewed in terms of an integrated data base.
- Published
- 1976
507. Distributed Processor/Memory Architectures Design Program
- Author
-
TEXAS INSTRUMENTS INC DALLAS, Consolver, G., Ackley, D., Rickard, M., McAfee, R., Shipchandler, T., TEXAS INSTRUMENTS INC DALLAS, Consolver, G., Ackley, D., Rickard, M., McAfee, R., and Shipchandler, T.
- Abstract
The purpose of Distributed Processor/Memory Architecture (DP/M) design program was to extend the DP/M avionic system processing concept to a detailed system hardware and software design. The functional design for the DP/ M Processing Element (PE) is summarized, including the processor, memory, input/ output interface, and a dual-level time-division-multiplex bus interface unit. A set of simulation and analysis programs was developed for modeling both the high-level network interaction among interconnected Processing Elements and the detailed internal operation of the PE. Other major areas examined were the executive control software, the process construction methodology required to develop and allocate real-time software for DP/M, and methods that could be used with DP/M to promote avionic system fault tolerance.
- Published
- 1975
508. Third Generation Graphics for Distributed Systems
- Author
-
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, Lantz,Keith A, Cheriton,David R, Nowicki,William I, STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, Lantz,Keith A, Cheriton,David R, and Nowicki,William I
- Abstract
The Stanford Network Graphics Project has the goal of providing high-quality interactive graphics over both local-area and long-haul networks. Specifically, a user sitting at an intelligent workstation should have simultaneous access to a variety of graphical and non-graphicl applications distributed throughout an internetwork. Interaction with these applications must be responsive, which, requires that much of the interaction be handled by the workstation itself. To do so the workstation must deal in terms of high-level objects, rather than graphical output primitives. That is, it must provide both modeling and viewing facilities in contrast to contemporary graphics systems. This paper describes the system architecture we have developed and the hardware and software components we are using to realize this architecture in the Standford University Network environment. (Author)
- Published
- 1983
509. On Describing the Behavior and Implementation of Distributed Systems
- Author
-
GEORGIA INST OF TECH ATLANTA, Lynch,Nancy A., Fischer,Michael J., GEORGIA INST OF TECH ATLANTA, Lynch,Nancy A., and Fischer,Michael J.
- Published
- 1981
510. Laboratory for Computer Science Progress Report 16, 1 July 1978 - 30 June 1979
- Author
-
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Dertouzos,Michael L, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, and Dertouzos,Michael L
- Abstract
This report summarizes the research performed by the MIT Laboratory for Computer Science from July 1, 1978 to June 30, 1979. (Author)
- Published
- 1980
511. Fundamental Algorithms for Concurrency Control in Distributed Database Systems.
- Author
-
COMPUTER CORP OF AMERICA CAMBRIDGE MA, Bernstein,Philip A, Goodman,Nathan, COMPUTER CORP OF AMERICA CAMBRIDGE MA, Bernstein,Philip A, and Goodman,Nathan
- Published
- 1980
512. Distributed Sensor Systems and Electromechanical Analog Facility
- Author
-
BATTELLE COLUMBUS DIV OH, Volz, Richard A, Bement, S L, Jungclas, Richard, Rosenbaum, T, Sesek, E J, Wenstrand, S , J, BATTELLE COLUMBUS DIV OH, Volz, Richard A, Bement, S L, Jungclas, Richard, Rosenbaum, T, Sesek, E J, and Wenstrand, S , J
- Abstract
Distributed sensor systems are key ingredients in many real world applications. Specific instances abound both in industrial and military environments, e.g., the monitoring (and possibly control) of manufacturing operations, or the dispersion of various types of sensors to detect enemy movements. There are two major areas of study in distributed sensors: the design and development of the sensors themselves, and the logical use of such sensors. This report is directed toward mechanisms to study the latter. Some examples of the latter, explained in detail, are based on CICE/ECE/IOE 469, a course in Real Time Computing Systems developed at the University of Michigan, Ann Arbor. Both student and faculty critiques of the electromechanical analog facility used in the program are included., Prepared in cooperation with VerChron Systems, Saline, MI.
- Published
- 1980
513. Software Maintenance Manual for the Modular System Control Development Model (MSCDM). Book 1.
- Author
-
BURROUGHS CORP PAOLI PA FEDERAL AND SPECIAL SYSTEMS GROUP and BURROUGHS CORP PAOLI PA FEDERAL AND SPECIAL SYSTEMS GROUP
- Abstract
The Distributed Master Control Program (DMCP) and the technical control application programs of the Modular System Control Development Model (MSCDM) are described. Program listings of each program and subprogram are presented. Programs are written in FORTRAN and MACRO-11 for Digital Equipment Corporation (DEC) LSI-11 microcomputers., See also Book 2, AD-A078 392.
- Published
- 1979
514. Software Maintenance Manual for the Modular System Control Development Model (MSCDM). Book 2.
- Author
-
BURROUGHS CORP PAOLI PA FEDERAL AND SPECIAL SYSTEMS GROUP and BURROUGHS CORP PAOLI PA FEDERAL AND SPECIAL SYSTEMS GROUP
- Abstract
Program descriptions and listings of the Modular System Control Development Model utility programs and diagnostics are presented. This includes the Bootstrap Load Facility for the Ring Architecture., See also Book 3, AD-A078 393.
- Published
- 1979
515. Software Maintenance Manual for the Modular System Control Development Model (MSCDM). Book 3.
- Author
-
BURROUGHS CORP PAOLI PA FEDERAL AND SPECIAL SYSTEMS GROUP and BURROUGHS CORP PAOLI PA FEDERAL AND SPECIAL SYSTEMS GROUP
- Abstract
Program flow charts for each Modular System Control Development Model (MSCDM) program is presented. Flow charts for all operating systems, application, diagnostic and utility programs are included in this single volume., See also Book 1, AD-A078 391.
- Published
- 1979
516. Distributed Computer Systems: Structure and Semantics
- Author
-
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Svobodova,Liba, Liskov,Barbara, Clark,David, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Svobodova,Liba, Liskov,Barbara, and Clark,David
- Abstract
This report describes an ongoing project in the area of design of distributed systems. The goal is to develop an effective programming system that will support well-structured design, implementation, maintenance and control of distributed processing applications. This programming system combines a powerful high level language and operating system features, and addresses the underlying system problems that affect the reliability and security perceived on the application level. The report presents a conceptual model of distributed computation, and, in the context of this model, discusses our approaches to inter-node communication and cooperation, reliability, and protection. One of the basic goals of our project is to allow the application programmer to work with application-oriented entities. Thus, inter-node messages, error handling and protection constraints will all be expressible in application oriented terms. The report concludes with some examples of the language constructs and an outline of the future research under this project. (Author)
- Published
- 1979
517. Functionally Distributed Computing Systems: User Facility Development.
- Author
-
KANSAS STATE UNIV MANHATTAN DEPT OF COMPUTER SCIENCE, Maryanski,Fred, KANSAS STATE UNIV MANHATTAN DEPT OF COMPUTER SCIENCE, and Maryanski,Fred
- Abstract
Under a grant from the Army Research Office, Kansas State University investigated and studied the feasibility of establishing the multiple minicomputers of the School of Aerospace Medicine into a network of computer resources. A PDP 11/70 and a PDP 11/34 were acquired for use as host computer in a distributed processing configuration. Simulations were written to test the network concept prior to installation. The report describes the result of the investigation. (Author)
- Published
- 1979
518. Naming and Synchronization in a Decentralized Computer System.
- Author
-
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Reed,David Patrick, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, and Reed,David Patrick
- Abstract
In this dissertation, a new approach to the synchronization of accesses to shared data objects is developed. Traditional approaches to the synchronization problems of shared data accessed by concurrently running computations have relied on mutual exclusion -- the ability of one computation to stop the execution of other computations that might access or change shared data accessed by that computation. Our approach is quite different. We regard an object that is modifiable as a sequence of immutable versions, each version is the state of the object after an update is made to the object. Synchronization can then be treated as a mechanism for naming versions to be read and for defining where in the sequence of versions the version resulting from some update should be placed. In systems based on mutual exclusion, the timing of accesses selects the versions accessed. In the system developed here, called NAMOS, versions have two component names consisting of the name of an object and a pseudo-time, the name of the system state to which the version belongs. By giving programs control over the pseudo-time in which an access is made, synchronization of accesses to multiple objects is simplified.
- Published
- 1978
519. Research Directions in Computer Architecture
- Author
-
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Dennis,Jack B, Fuller,Samuel H, Ackerman,William B, Swan ,Richard J, Weng,Kung-Song, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Dennis,Jack B, Fuller,Samuel H, Ackerman,William B, Swan ,Richard J, and Weng,Kung-Song
- Abstract
The 'architecture' of a computer system defines the interface that the hardware presents to the software of the system, and determines how this interface is realized by subunits of the computer system. In the early days of the stored program computer, knowledge of logic design, the technology of logic and memory devices, elementary machine language programming techniques, and a good measure of common sense were all that was required to be a computer architect. Now things have changed. Our concept of what we expect a computer system to do has reached a high degree of sophistication -- large data bases, multiple concurrent processes, and programming languages that offer recursive programming, abstract data types, protection, and access control. These expectations have been met by elaborate software systems -- operating systems, data management systems and runtime support for language implementations. The ability of system designers to meet these expectations, and the quality of the facilities they can provide to the application programmer, are critically dependent on properties of mechanisms built into the hardware. Thus it has become essential that contemporary computer architects be aware of how architectural decisions interact with software quality -- how hardware structures can more effectively meet the needs of operating systems and modern concepts or program and data structure.
- Published
- 1978
520. Navy Interest in Distributed Computer Systems.
- Author
-
NAVAL SURFACE WEAPONS CENTER DAHLGREN LAB VA, Warner,Walter P, NAVAL SURFACE WEAPONS CENTER DAHLGREN LAB VA, and Warner,Walter P
- Abstract
To present the Navy's interest in distributed computer systems, this paper first discusses the nature of Navy systems and some of the constraints created by Navy philosophy. Secondly, some of the requirements of naval systems are presented. A couple of busing systems being investigated by the Navy are mentioned briefly, and some of the problems to be faced, as the author views them, are presented. (Author), Presented at the Computer Software and Applications Conference (COMPSAC 78), Chicago, IL. 13-16 Nov 78.
- Published
- 1978
521. Navy Distributed Computer Systems Workshop (June 1977).
- Author
-
NAVAL SURFACE WEAPONS CENTER DAHLGREN LAB VA, Warner,Walter P, Dejka,William J, NAVAL SURFACE WEAPONS CENTER DAHLGREN LAB VA, Warner,Walter P, and Dejka,William J
- Abstract
Results of a workshop held for the purpose of discussing the impact, payoff, and technical issues of distributed computer systems are reported. At the workshop, attendees with diverse backgrounds and experience were able to (1) have a common understanding of distributed systems designs criteria; (2) conduct a quick and complete review of distributed concepts and approaches used in current Navy systems implementation, (3) conduct a state-of-the-art survey of distributed systems theory, (4) compare common issues in relation to Navy-distributed systems, and (5) provide discussions beneficial to both technical and management areas on trends, ideas, and technologies in Navy systems development. (Author)
- Published
- 1978
522. Distributed Computation and Tenex-Related Activities
- Author
-
BOLT BERANEK AND NEWMAN INC CAMBRIDGE MA, Schantz, R, Thomas, R, BOLT BERANEK AND NEWMAN INC CAMBRIDGE MA, Schantz, R, and Thomas, R
- Abstract
This report describes BBN efforts in the design of the National Software Works system and BBN efforts to integrate TENEX into the National Software Works system. BBN participation in the National Software Works project is divided into three major areas. These are system design, system implementation, and contractor/sponsor meetings to coordinate design and implementation goals and strategies. During this quarter most of the effort has been in the latter two areas., See also report dated Jun 1976, ADA025956.
- Published
- 1976
523. Automated Data Acquisition Applied to Monitoring of Communications Systems.
- Author
-
ELECTRONICS ENGINEERING GROUP (1842ND) RICHARDS-GEBAUR AFB MO, Lindberg,David A., ELECTRONICS ENGINEERING GROUP (1842ND) RICHARDS-GEBAUR AFB MO, and Lindberg,David A.
- Abstract
This report describes a design concept for an automated distributed data acquisition system. Particular emphasis is placed on uses of automated state-of-the-art data acquisition techniques for monitoring of communication systems. Use of distributed processing, industry standard interfaces, and a real-time software operating system is discussed.
- Published
- 1976
524. Shipboard Application of a Ring Structured Distributed Computing System.
- Author
-
NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF, Jackson,Jeffrey Quentin, NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF, and Jackson,Jeffrey Quentin
- Abstract
Considerable research is currently going on into the application of distributed computing systems. They appear particularly suitable for the computing needs of a small warship. The particular constraints of the warship's environment are discussed. This is followed by a description of how a ring structured distributed computing system might be adapted to function in this environment. Included in this consideration are the feasibility of attaining adequate bus speed, the use of multiply addressed messages, and methods of handling real-time processing. Of particular interest is the ability to achieve controlled degradation of performance under failure, especially failure due to battle damage.
- Published
- 1976
525. The Basic Operating System for the Distributed Computer Network.
- Author
-
MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER SCIENCE, Mills,David L., MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER SCIENCE, and Mills,David L.
- Abstract
This report describes the Basic Operating System (BOS) for the Distributed Computer Network (DCN). The BOS is a multiprogramming executive providing process and storage management, interprocess communications, input/output device control and application-program support. It operates with any PDP11 model including at least 4K of storage, an operator's console and a communication device for connection to the DCN. Included in this report is a description of the various components that make up the BOS and the manner in which they operate. Also described are the various primitive functions and command operations used to control the operation of the network and the various application programs. Other reports, listed in the references, describe the functioning of the DCN as a whole and also the upwardly-compatible Virtual operating System (VOS) developed for PDP11 models with memory management features.
- Published
- 1975
526. Interactive Computer Graphics.
- Author
-
BROWN UNIV PROVIDENCE R I DIV OF APPLIED MATHEMATICS, VAN Dam,Andries, BROWN UNIV PROVIDENCE R I DIV OF APPLIED MATHEMATICS, and VAN Dam,Andries
- Abstract
The goal of this research in distributed computing is to evolve fundamental concepts as well as implementation techniques for improving system performance by judicious runtime distribution of functions to processors and to levels of a hierarchical operating system. This distribution of computing tasks among the various processors in a network or among the many levels of a hierarchical operating system in a single computer is a critical issue in current and future military, industrial, and educational computer systems. The present approach is to provide the applications programmer with tools that allow both the estimation of performance improvements of potential migrations, either horizontal (inter-processor) or vertical (intra-processor), and the implementation of the most promising migrations., Continuation of Contract No. N00014-67-A-0191-0023.
- Published
- 1976
527. The Practical Impact of Recent Computer Advances on the Analysis and Design of Large Scale Networks
- Author
-
NETWORK ANALYSIS CORP GREAT NECK NY, Frank, Howard, Slyke, Richard Van, NETWORK ANALYSIS CORP GREAT NECK NY, Frank, Howard, and Slyke, Richard Van
- Abstract
This report summarizes studies of local, regional, and large scale data communication network problems. Primary emphasis is placed on system issues and tradeoffs. Areas discussed are packet radio system studies, packet radio system algorithms and control, local and regional data network cost comparisons and alternatives, and integrated large scale packet switched network cost and performance. Studies of multidropped, point-to-point, and broad band cable and radio broadcast systems as well as the impact of satellites on network cost and performance are described., See also report dated Jun 1974, ADA016577.
- Published
- 1974
528. A Distributed Operating System Design and Dictionary/Directory for the Stock Point Logistics Integrated Communications Environment.
- Author
-
NAVAL POSTGRADUATE SCHOOL MONTEREY CA, Schneidewind,N F, Dolk,D R, NAVAL POSTGRADUATE SCHOOL MONTEREY CA, Schneidewind,N F, and Dolk,D R
- Abstract
The problems and opportunities involved with designing and using distributed systems are discussed. This is followed by presenting a paradigm for the distributed system design process. The paradigm is then applied to the design of a distributed operating system for SPLICE. The major interface between user and operating system is provided by the dictionary/directory system. (Author)
- Published
- 1983
529. Research on Distributed Artificial Intelligence.
- Author
-
SRI INTERNATIONAL MENLO PARK CA, Rosenschein,Stanley J, SRI INTERNATIONAL MENLO PARK CA, and Rosenschein,Stanley J
- Abstract
The ultimate goal of the DAI project is to discover the essential principles upon which construction of a network of cooperative intelligent computer agents could be based. The motivations for distributed AI arise from at least three sources. First, many military problems have an inherently distributed character by virtue of the physical distribution not only of military units themselves but also of the various sensors that provide information affecting those units. Second, the changing economics of computer hardware and communications technology are making distributed systems increasingly cost-effective; since distributed systems with computationally powerful processors will soon be more commonplace, it is worthwhile considering how AI could be used to exploit such systems more fully. Third, there is a strong motivation from within AI. Artificial-intelligence systems that act in an environment must reason about that environment. Thus, when the environment contains other agents, as most realistic environments do, the AI system must reason about the state of those agents and how to affect it. This leads naturally to distributed AI.
- Published
- 1982
530. A distributed operating system design and dictionary/directory for the Stock Point Logistics Integrated Communications Environment
- Author
-
Naval Postgraduate School (U.S.), Schneidewind, Norman F., Dolk, Daniel R., Naval Postgraduate School (U.S.), Schneidewind, Norman F., and Dolk, Daniel R.
- Abstract
The problems and opportunities involved with designing and using distributed systems are discussed. This is followed by presenting a paradigm for the distributed system design process. The paradigm is then applied to the design of a distributed operating system for SPLICE. The major interface between user and operating system is provided by the dictionary/directory system., supported by the Fleet Material Support Office, http://archive.org/details/distributedopera00schn, N0036783POM3883, NA
- Published
- 1983
531. Determining what characteristics constitute a darknet
- Author
-
Aked, Symon, Bolan, Christopher, Brand, Murray, Aked, Symon, Bolan, Christopher, and Brand, Murray
- Abstract
Aked S., Bolan C., Brand M. (2014). Determining what characteristics constitute a darknet. Proceedings of the 11th Australian Information Security Management Conference, ISM 2013. (pp. 12-20). Edith Cowan University. Available here
532. Controlled access to cloud resources for mitigating economic denial of sustainability (EDoS) attacks
- Author
-
Baig, Zubair A, Sait, Sadiq M., Binbeshr, Farid, Baig, Zubair A, Sait, Sadiq M., and Binbeshr, Farid
- Abstract
This is an Author's Accepted Manuscript of: Baig, Z. A., Sait, S. M., & Binbeshr, F. (2016). Controlled Access to Cloud Resources for Mitigating Economic Denial of Sustainability (EDoS) Attacks. Computer Networks, 97, 31-47. Original article vailable here.
533. The method of constructing models of peer to peer protocols
- Author
-
Demidova A.V., Korolkova A.V., Kulyabov D.S., Sevastyanov L.A., Demidova A.V., Korolkova A.V., Kulyabov D.S., and Sevastyanov L.A.
- Abstract
The models of peer to peer protocols are presented with the help of one-step processes. On the basis of this presentation and the method of randomization of one-step processes, it is described method for constructing models of peer to peer protocols. The models of FastTrack and Bittorrent protocols are studied by means of proposed method. © 2014 IEEE.
534. A distributed operating system design and dictionary/directory for the Stock Point Logistics Integrated Communications Environment
- Author
-
Schneidewind, Norman F., Dolk, Daniel R., and Naval Postgraduate School (U.S.)
- Subjects
Local Computer Networks ,Distributed Computer Systems ,DICTIONARY/DIRECTORY SYSTEMS ,Operating System Design ,Dictionary /Directory Systems - Abstract
The problems and opportunities involved with designing and using distributed systems are discussed. This is followed by presenting a paradigm for the distributed system design process. The paradigm is then applied to the design of a distributed operating system for SPLICE. The major interface between user and operating system is provided by the dictionary/directory system. supported by the Fleet Material Support Office http://archive.org/details/distributedopera00schn N0036783POM3883 NA
- Published
- 1983
535. Assessment of job allocation on heterogeneous computer networks
- Author
-
Orazio Mirabella, Lucia Lo Bello, and A. Di Stefano
- Subjects
Unix ,Workstation ,Point (typography) ,Computer science ,business.industry ,Computation ,Distributed computing ,General Engineering ,Distributed computer systems ,scheduling ,Software package ,law.invention ,Allocator ,Task (computing) ,law ,Homogeneous ,business ,Software ,Computer network - Abstract
The aim of this paper is to deal with the problem of balancing load between the workstations in a network. In particular it addresses the main questions which arise in introducing a software package for distributed task allocation in a workstation network. The aim is to evaluate the impact on performance and the possibility of implementation in a real heterogeneous environment. We have considered the performance of some algorithms originally evaluated by Eager for a homogeneous environment. We point out the further complications introduced by the heterogeneity and possible solutions to them by referring to a distributed job allocator we have developed in a heterogeneous Unix environment. The result of the experimental evaluation allows us to extend to heterogeneous distributed systems the results produced by Eager, showing that in reality it is onerous, in terms of computation and communication, to improve the single workstation's knowledge of the entire load, but the use of a small amount of additional information allows a substantial improvement in the performance of the system.
536. Adaptive collective systems are we ready to let go of control?
- Author
-
Maarten van Steen
- Subjects
Control systems ,Adaptive collective systems ,Distributed computer systems - Abstract
The field of computer science is rapidly changing, and we often barely seem to notice it. For years we have been working on the same topics, and many of us expect to continue do so for still a long time to come. Moore’s law is no longer determining the speedups of our programs: new algorithms and insights are pushing us further to an extent that some believe we need to start worrying about Artificial Intelligence. Computer science is eating the world, and we are the ones responsible for that. Yet, we want to stay in control. I argue that we need get into a different mindset: let go of control. A while back, I joined a team of experts on computational intelligence in an attempt to write a booklet on adaptive collective systems. It taught me a lot about how colleagues in the same field were looking at what is important in computer science. Coming from computer systems research, it now seems to me that my view is conservative. Many colleagues concentrating on developing software constructs are often being conservative as well. We need to let a few things go. I will talk about adaptive collective systems as being a special type of distributed computer system in which control, or rather, the lack of control, plays a crucial role. Control is no longer fixed; it evolves through learning mechanisms. The take-away message is that our future distributed systems need to be architected with learning facilities. However, considering that there are so many different types of computer systems, it is not obvious how learning should be incorporated.
537. On power of P Systems using sequential and parallel rewriting
- Author
-
Krishna, S. N. and Rama Raghavan
- Subjects
Computation theory ,Hierarchical systems ,Mathematical models ,Variable thickness ,Parallel rewriting ,External output ,Parallel processing systems ,Turing machines ,Computationally universal ,Cooperation and priorities ,Rewriting P systems ,Distributed computer systems - Abstract
A new class of distributed computing models inspired from biology, that of P Systems, was recently introduced by Gh. P?un. Several variants of P Systems were already shown to be computationally universal, equal in power to Turing Machines. We investigate in this paper the power of computability of P Systems based on rewriting, with cooperation, priorities and external output. It is established that rewriting P Systems with priorities and two membranes is computationally universal, thereby making an improvement in the existing result that REC ? RP3(Pri). We give a new model in P Systems stressing the importance of parallelism. The power of computability of such models is investigated by comparing them with classic mechanisms in L-Systems: TOL, EOL and ETOL Systems. ? 2001 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint.
538. Argumentative and cooperative multi-agent system for extended logic programming
- Author
-
José Júlio Alferes, Iara de Almeida Móra, and CENTRIA – Centro de Inteligência Artificial
- Subjects
Inference engines ,Argumentative ,Artificial intelligence ,Computation theory ,argumentation frameworks ,Computer science ,Inference ,Semantics ,Argumentation framework ,Logic programming ,Argumentation theory ,Theoretical Computer Science ,Logical programming ,Formal specification ,Formal language ,Inference engine ,Non-monotonic logic ,Multi agent systems ,business.industry ,Multi-agent system ,Computer circuits ,Reconfigurable hardware ,Distributed computer systems ,Theory of computation ,business ,Computer Science(all) - Abstract
The ability to view extended logic programs as argumentation systems opens the way for the use of this language in formalizing communication among reasoning computing agents in a distributed framework. In this paper we define an argumentative and cooperative multi-agent framework, introducing credulous and sceptical conclusions. We also present an algorithm for inference and show how the agents can have more credulous or sceptical conclusions. publishersversion published
539. Secure and minimal protocols for authenticated key distribution
- Author
-
Philippe Janson and Gene Tsudik
- Subjects
Authentication ,Interleaving ,Computer Networks and Communications ,business.industry ,Computer science ,Network security ,Distributed computing ,Security of data ,Key distribution ,Cryptography ,Encryption ,Distributed computer systems ,Hierarchical systems ,Security association ,Computational methods ,Communications protocol ,business ,Computer network ,Computer Science::Cryptography and Security - Abstract
The problem of secure key distribution has been the subject of much attention in recent years. This paper describes a novel method for authenticated key distribution in the distributed systems environment. In particular, a braiding technique for key distribution is introduced. The underlying protocols are extremely compact in both the number of messages and message sizes, which facilitates their application at any layer (at lower layers, in particular) in the protocol hierarchy. Furthermore, the protocols are shown to be resistant to a wide range of interleaving attacks. All this is achieved with minimal computational requirements, and without the necessity of using traditional encryption (a strong one-way function suffices).
540. A model transformation approach for the development of HLA-based distributed simulation systems
- Author
-
D Ambrogio, A., Iazeolla, G., Alessandra Pieroni, and Gianni, D.
- Subjects
HLA ,MDA ,Model driven development ,Software architecture ,High level architecture ,Distributed simulation systems ,Computer simulation ,Unified Modeling Language ,Settore ING-INF/05 - Sistemi di Elaborazione delle Informazioni ,Model transformation, Distributed computer systems ,Standardization ,Unified Modeling Language, Computer simulation ,Model transformation ,Distributed computer systems
541. The complexity of synchronous iterative do-all with crashes
- Author
-
Georgiou, Chryssis, Russell, A., Shvartsman, A. A., Welch J., and Georgiou, Chryssis [0000-0003-4360-0260]
- Subjects
Theoretical computer science ,Matching (graph theory) ,Computer Networks and Communications ,Computer science ,Iterative methods ,Parallel algorithm ,Network management ,Shared memory algorithms ,Synchronization ,Distributed systems ,Decision theory ,Upper and lower bounds ,Theoretical Computer Science ,Sensitive analysis ,Cost benefit analysis ,Algorithm simulation ,Probabilistic analysis of algorithms ,Analysis of parallel algorithms ,Processing steps ,Model of computation ,Lower bounds ,Fault tolerant computer systems ,Distributed computer systems ,Computational complexity ,Fault-tolerance ,Computational Theory and Mathematics ,Hardware and Architecture ,Distributed algorithm ,Theory of computation ,Distributed and parallel algorithm ,Distributed algorithms ,Algorithm ,Algorithms ,Work complexity - Abstract
The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multi-agent collaboration. Do-All, an abstraction of such cooperative activity, is the problem of performing N tasks in a distributed system of P failure-prone processors. Many distributed and parallel algorithms have been developed for this problem and several algorithm simulations have been developed by iterating Do-All algorithms. The efficiency of the solutions for Do-All is measured in terms of work complexity where all processing steps taken by all processors are counted. Work is ideally expressed as a function of N, P, and f, the number of processor crashes. However the known lower bounds and the upper bounds for extant algorithms do not adequately show how work depends on f. We present the first non-trivial lower bounds for Do-All that capture the dependence of work on N, P and f. For the model of computation where processors are able to make perfect load-balancing decisions locally, we also present matching upper bounds. We define the r-iterative Do-All problem that abstracts the repeated use of Do-All such as found in typical algorithm simulations. Our f-sensitive analysis enables us to derive tight bounds for r-iterative Do-All work (that are stronger than the r-fold work complexity of a single Do-All). Our approach that models perfect load-balancing allows for the analysis of specific algorithms to be divided into two parts: (i) the analysis of the cost of tolerating failures while performing work under "free" load-balancing, and (ii) the analysis of the cost of implementing load-balancing. We demonstrate the utility and generality of this approach by improving the analysis of two known efficient algorithms. We give an improved analysis of an efficient message-passing algorithm. We also derive a tight and complete analysis of the best known Do-All algorithm for the synchronous shared-memory model. Finally we present a new upper bound on simulations of synchronous shared-memory algorithms on crash-prone processors. 17 1 47 63 Cited By :13
542. Architecture framework for mapping parallel algorithms to parallel computing platforms
- Author
-
Bedir Tekinerdogan and Arkin, E.
- Subjects
Architectural viewpoints ,Architecture frameworks ,Precise modeling ,Model driven software development ,Parallel algorithms ,Parallel computing platform ,Parallel programming ,Problem oriented languages ,Computational linguistics ,Domain specific languages ,Domain specific language ,Modelling ,Distributed computer systems ,Computer programming languages ,Architectural frameworks ,Parallel architectures ,Mapping ,Models ,Cloud computing ,Model-Driven Software Development ,Modeling languages ,High performance computing ,Software design ,Algorithms - Abstract
Mapping parallel algorithms to parallel computing platforms requires several activities such as the analysis of the parallel algorithm, the definition of the logical configuration of the platform, and the mapping of the algorithm to the logical configuration platform. Unfortunately, in current parallel computing approaches there does not seem to be precise modeling approaches for supporting the mapping process. The lack of a clear and precise modeling approach for parallel computing impedes the communication and analysis of the decisions for supporting the mapping of parallel algorithms to parallel computing platforms. In this paper we present an architecture framework for modeling the various views that are related to the mapping process. An architectural framework organizes and structures the proposed architectural viewpoints. We propose five coherent set of viewpoints for supporting the mapping of parallel algorithms to parallel computing platforms. We illustrate the architecture framework for the mapping of array increment algorithm to the parallel computing platform. Copyright © 2013 for the individual papers by the papers' authors.
543. Personalized navigation of heterogeneous product spaces using SmartClient
- Author
-
Boi Faltings and Pearl Pu
- Subjects
business.industry ,Computer science ,Intelligent agents ,Electronic commerce ,Graphical user interfaces ,Information access ,computer.software_genre ,Visualization ,Personalization ,Distributed computer systems ,Intelligent agent ,Human–computer interaction ,Nonlinear programming ,Constraint programming ,Product (category theory) ,Computer architecture ,business ,computer ,Online searching ,Constraint theory ,Data integration ,Graphical user interface - Abstract
Personalization in e-commerce has so far been server-centric, requiring users to create a separate individual profile on each server that they like to access. As product information is increasingly coming from multiple and heterogeneous sources, the number of profiles becomes unmanageably large. We present SmartClient, a technology based on constraint programming where a thin but intelligent client provides personalized information access for its user. As the process can run on the user's side, it allows much stronger filtering and visualization support with a wider range of personalization options than existing tools. It also eliminates the need to personalize many sites individually with different parameters, and supports product configuration and integration of different information sources in the same framework. We illustrate the technology using an application in travel e-commerce, which is currently under commercial deployment.
544. Distributed construction and maintenance of bandwidth-efficient bluetooth scatternets
- Author
-
Metin Tekkalmaz, H. Sozer, and Ibrahim Korpeoglu
- Subjects
Bluetooth networks ,Computer science ,Wireless ad hoc network ,Distributed computing ,02 engineering and technology ,law.invention ,Traffic flow (computer networking) ,Bluetooth ,Bandwidth ,law ,Piconet ,0202 electrical engineering, electronic engineering, information engineering ,Bandwidth (computing) ,IR-64100 ,Computer networks ,Traffic flow rates ,Problem solving ,Mobile computing ,Scatternet ,business.industry ,METIS-227950 ,020206 networking & telecommunications ,Spectral efficiency ,Computer simulation ,Distributed computer systems ,020202 computer hardware & architecture ,Telecommunication traffic ,EWI-10202 ,Scatternets ,Distributed algorithm ,Distributed algorithms ,business ,Algorithms ,Computer network - Abstract
Date of Conference: 16-20 May 2005 Conference name: IEEE International Conference on Communications, ICC 2005 Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet construction policies and algorithms are not well specified. Among many solution proposals for this problem, only a few of them focus on efficient usage of bandwidth in the resulting scatternets. In this paper, we propose a distributed algorithm for scatternet construction problem, that dynamically constructs and maintains a scatternet based on estimated traffic flow rates between nodes. The algorithm is adaptive to changes and maintains a constructed scatternet for bandwidth-efficiency when nodes come and go or when traffic flow rates change. Based on simulations, the paper also presents the improvements in bandwidth-efficiency provided by the proposed algorithm. © 2005 IEEE.
545. A reputation-based trust management system for P2P networks
- Author
-
Selçuk, A. A., Uzun, E., and Pariente, M. R.
- Subjects
Free-riders ,P2P network security ,File sharing application ,P2P system ,Peer to peer networks ,Trust management ,Trust management systems ,Reputation systems ,P2P network ,Potential benefits ,Distributed computer systems ,Management - Abstract
The open and anonymous nature of a P2P network makes it an ideal medium for attackers to spread malicious con-tent. In this paper, we propose a reputation-based trust management system for P2P networks that aims to build confidence among the good members of the community and identify the malicious ones. The proposed system is simple and efficient in design and can be integrated into most first generation P2P systems easily. A diverse set of simulation experiments conducted to test the perfor-mance of the system show that it can be highly effective in preventing the spread of malicious content. The pro-posed system has other potential benefits as well, such as supporting the detection of free riders in a file sharing application.
546. Scalability and flexibility in authentication services: The KryptoKnight approach
- Author
-
Philippe Janson, M. Yung, and Gene Tsudik
- Subjects
Flexibility (engineering) ,Authentication ,Network security ,business.industry ,Computer science ,Distributed computing ,Key distribution ,Distributed computer systems ,Resource (project management) ,Data communication systems ,Scalability ,Cryptography ,Message authentication code ,Network protocols ,Information services ,business ,Communications protocol ,Computer network - Abstract
This paper studies the issues of flexibility and scalability in the context of network security. In particular, it concentrates on authentication and key distribution services suited for a variety of communication paradigms, network environments, and end-devices. We present the design criteria, specification, and step-by-step construction of authentication and key distribution services based on experience in the KryptoKnight project. The central goal of the KryptoKnight project was the construction of basic network security functions in a minimal, flexible (thus, versatile) and scalable manner. Protocol minimality (in terms of resource usage) and flexibility are not merely theoretical goals; they have clear advantages in environments where computational resources are limited and connectivity is restricted. KryptoKnight was aimed at such environments: small and anemic wireless devices, simple network and data-link entities, embedded micro-devices and other special-purpose communication equipment and configurations. Furthermore, scalability of protocols makes their deployment possible in the presence of rapid network growth and inter-domain communication.
547. On the power of P systems with contextual rules
- Author
-
Krishna, S. N., Lakshmanan, K., and Rama Raghavan
- Subjects
Hamiltonians ,Mathematical models ,Problem solving ,Encoding (symbols) ,Molecular biology ,Contextual rules ,Cells ,Set theory ,Matrix algebra ,Distributed computer systems - Abstract
We consider P Systems with string objects which evolve by means of one-sided contextual rules and erasing contextual rules. The generative power of these systems with three or less than three membranes is investigated. We show that systems with three membranes characterize the family of recursively enumerable languages. When the string replication is used in one-sided contextual rules, these systems are able of solving NP-complete problems in linear time: this is exemplified with SAT and HPP.
548. E-collaboration for earth observation: Example challenge focused on the atmospheric correction of ocean colour data
- Author
-
Samantha Lavender, Boissier, E., Brito, F., Ribeiro, R., Aas, C., Casu, F., and Iapaolo, M.
- Subjects
Earth observation data ,Atmospheric corrections ,e-collaboration ,collaborative platforms ,Distributed computer systems - Abstract
The E-Collaboration for Earth Observation (E-CEO) project aimed to deliver a collaborative platform that, through data challenges, would improve the adoption and outreach of new applications and methods to process Earth Observation (EO) data. To test the E-CEO platform, a contest based on the Atmospheric Correction (AC) of ocean color data was proposed. Existing processors were tested, and the evaluation results analysed. Overall, the challenge showed that the E-CEO platform can be used to simplify the process of comparing different processors. Once the different participants' software is uploaded and connected to the data packages, the processing runs automatically, and so the processing is quick to re-run and adjust. However, additional work has shown it's important to continue to have human involvement in the evaluation step as otherwise statistics may be incorrectly interpreted due to outliers.We acknowledge ESA and ACRI-ST for developing ODESA (http://earth.eo.esa.int/odesa), which includes MEGS, and ESA for collecting, processing and making available the MERIS dataset. NASA have led the development of SeaDAS and the NOMAD database, which is available thanks to NASA and the PIs for collecting the in-situ data. ESA funded the E-CEO project under the Research Service Support activities (SOW TRPE-GSEG-EOPGSW-12-0001), with Terradue UK Ltd as the prime.
549. A Survey on Trusted Distributed Artificial Intelligence
- Subjects
Distributed Artificial Intelligence ,Artificial intelligence ,Trusted execution environment (TEE) ,Software defined networking (SDN) ,Trusted artificial intelligence ,Peer to peer networks ,Trusted AI ,Network security ,Trusted execution environment ,Surveys ,Distributed systems ,Adaptive control systems ,Distributed computer systems ,Trusted execution environments ,Software defined networking ,Software-defined networkings ,Security ,Peer-to-peer computing - Abstract
Emerging Artificial Intelligence (AI) systems are revolutionizing computing and data processing approaches with their strong impact on society. Data is processed with automated labelling pipelines rather than providing it as input to the system. The innovative nature increases the overall performance of monitoring/detection/reaction mechanisms for efficient system resource management. However, due to hardware-driven design limitations, networking and trust mechanisms are not flexible and adaptive enough to be able to interact and control the resources dynamically. Novel adaptive software-driven design approaches can enable us to build growing intelligent mechanisms with software-defined networking (SDN) features by virtualizing network functionalities with maximized features. These challenges and critical feature sets have been identified and introduced into this survey with their scientific background for AI systems and growing intelligent mechanisms. Furthermore, obstacles and research challenges between 1950-2021 are explored and discussed with a focus on recent years. The challenges are categorized according to three defined architectural perspectives (central, decentral/autonomous, distributed/hybrid) for emerging trusted distributed AI mechanisms. Therefore, resiliency and robustness can be assured in a dynamic context with an end-to-end Trusted Execution Environment (TEE) for growing intelligent mechanisms and systems. Furthermore, as presented in the paper, the trust measurement, quantification, and justification methodologies on top of Trusted Distributed AI (TDAI) can be applied in emerging distributed systems and their underlying diverse application domains, which will be explored and experimented in our future related works. © 2013 IEEE.
550. Analysis of Optimal File Migration Policies in Distributed Computer Systems
- Published
- 1992
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.