检索结果-内蒙古大学图书馆

ELECTIONS IN A distributed computing SYSTEM

IEEE TRANSACTIONS ON COMPUTERS 1982年第1期31卷 48-59页

作者： GARCIAMOLINA, H Department of Electrical Engineering and Computer Science Princeton University Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions

After a failure occurs in a distributed computing system, it is often necessary to reorganize the active nodes so that they can continue to perform a useful task. The first step in such a reorganization or reconfiguration is to elect a coordinator node to manage the operation. This paper discusses such elections and reorganizations. Two types of reasonable failure environments are studied. For each environment assertions which define the meaning of an election are presented. An election algorithm which satisfies the assertions is presented for each environment.

关键词： Crash recovery distributed computing systems elections failures mutual exclusion reorganization

来源：评论

学校读者我要写书评

暂无评论

A High Performance Model for Task Allocation in distributed computing System Using K-Means Clustering Technique

引用

INTERNATIONAL JOURNAL OF distributed systems AND TECHNOLOGIES 2018年第3期9卷 1-23页

作者： Kumar, Harendra Chauhan, Nutan Kumari Yadav, Pradeep Kumar Gurukula Kangri Univ Dept Math & Stat Haridwar 249404 Uttarakhand India Cent Bldg Res Inst Dept Res Planning & Business Dev Roorkee Uttar Pradesh India

Tasks allocation is an important step for obtaining high performance in distributed computing system (DCS). This article attempts to develop a mathematical model for allocating the tasks to the processors in order to achieve optimal cost and optimal reliability of the system. The proposed model has been divided into two stages. Stage-I, makes the 'n' clusters of set of 'm' tasks by using k-means clustering technique. To use the k-means clustering techniques, the inter-task communication costs have been modified in such a way that highly communicated tasks are clustered together to minimize the communication costs between tasks. Stage-II, allocates the 'n' clusters of tasks onto 'n' processors to minimize the system cost. To design the mathematical model, executions costs and inter tasks communication costs have been taken in the form of matrices. To test the performance of the proposed model, many examples are considered from different research papers and results of examples have compared with some existing models.

关键词： distributed computing systems K-Means Clustering System Cost System Reliability Task Allocation

来源：评论

学校读者我要写书评

暂无评论

AN APPROACH TO distributed computing SYSTEM SOFTWARE-DESIGN

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1981年第4期7卷 427-436页

作者： YAU, SS YANG, CC SHATZ, SM Department of Electrical Engineering and Computer Science Northwestern University

A distributed computing system is characterized as follows: 1. It has a number of hardware processors with each processor having a certain computing capability. 2. Communications links exist between or among the processors. 3. A number of functional components reside on each processor, and the software components of different processors may be synchronous or asynchronous. 4. The functional components interact for the purpose of performing some system-wide functions. To deal with a distributed computing system as defined, the framework of an approach is presented for developing the system's design specifications. In this approach, data components and functional components are handled separately. A notation for the design is supplied, and performance estimates are given.

关键词： Specification Concurrent Processing Data And Functional Components distributed computing systems Performance Estimation Software Design Approach

来源：评论

学校读者我要写书评

暂无评论

DESIGNING REAL-TIME DEPENDABLE distributed systems

引用

COMPUTER COMMUNICATIONS 1992年第4期15卷 225-234页

作者： LELANN, G INRIA BP 105 78153 Le Chesnay Cedex France

The concepts of distribution, real-time and dependability have been investigated more or less separately until recently. This article reviews these concepts and, based on rigorous definitions, attempts to clarify some of the most important design issues raised with real-time dependable distributed computing systems. In particular, some popular misconceptions are examined, as well as the relationship existing between predictability and assumption complexity. The paper also investigates the relationships existing between the three areas of distribution, real-time and dependability, and focuses on the issue of algorithmic compatibility, whose importance has not yet been fully acknowledged.

关键词： distributed computing systems REAL-TIME DEPENDABILITY PREDICTABILITY

来源：评论

学校读者我要写书评

暂无评论

MIKE - A NETWORK OPERATING SYSTEM FOR THE distributed DOUBLE-LOOP COMPUTER NETWORK

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1983年第2期9卷 143-154页

作者： TSAY, DP LIU, MT OHIO STATE UNIV DEPT COMP & INFORMAT SCICOLUMBUSOH 43210

A distributed system - a special computer network with a high degree of cohesiveness, transparency, and autonomy - has such potential benefits as: 1. high availability, 2. greater reliability, 3. improved throughput and response time, 4. resource sharing and load leveling, and 5. modular and incremental growing. This research presents the framework and model of a network operating system (NOS) called Multicomputer Integrator Kernel (MIKE), for use in distributed systems, particularly in the distributed Double-Loop Computer Network (DDLCN). MIKE provides system-transparent operation for users and maintains cooperative autonomy among local hosts. MIKE is based on the object model and a unique ''task'' concept and uses message passing as an underlying semantic structure. The distributed system kernel has a layered protocol to support NOS, providing a flexible organization in which system-transparent resource sharing and distributed computing can evolve in a modular fashion. The NOS model and the notion of ''task'' are presented, and the system naming convention is examined. A 2-level process interaction model is also described. The protection mechanism is discussed, emphasizing maximal error confinement. A scenario for system-transparent resource sharing utilizing these concepts is given. A multilayer, multidestination protocol structure is outlined.

关键词： Synchronization Computer Networks distributed computing systems Interprocess Communication Network Operating systems Network Protocols Protection Resource Sharing

来源：评论

学校读者我要写书评

暂无评论

TOWARDS FORMAL SPECIFICATION OF A distributed computing SYSTEM

引用

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES 1985年第5期14卷 277-306页

作者： AGRAWAL, VK PATNAIK, LM GOEL, PS INDIAN INST SCI BANGALORE 560012KARNATAKAINDIA

Onboard spacecraft computing system is a case of a functionally distributed system that requires continuous interaction among the nodes to control the operations at different nodes. A simple and reliable protocol is desired for such an application. This paper discusses a formal approach to specify the computing system with respect to some important issues encountered in the design and development of a protocol for the onboard distributed system. The issues considered in this paper are concurrency, exclusiveness and sequencing relationships among the various processes at different nodes. A 6-tuple model is developed for the precise specification of the system. The model also enables us to check the consistency of specification and deadlock caused due to improper specification. An example is given to illustrate the use of the proposed methodology for a typical spacecraft configuration. Although the theory is motivated by a specific application the same may be applied to other distributed computing system such as those encountered in process control industries, power plant control and other similar environments.

关键词： distributed computing systems protocol design onboard computers formal specification

来源：评论

学校读者我要写书评

暂无评论

Real-World distributed Computer with Ibis

引用

COMPUTER 2010年第8期43卷 54-62页

作者： Bal, Henri E. Maassen, Jason van Nieuwpoort, Rob V. Drost, Niels Kemp, Roelof van Kessel, Timo Palmer, Nick Wrzesinska, Gosia Kielmann, Thilo van Reeuwijk, Kees Seinstra, Frank J. Jacobs, Ceriel J. H. Verstoep, Kees Vrije Univ Amsterdam Dept Comp Sci High Performance Distributed Syst Res Grp Amsterdam Netherlands

The use of parallel and distributed computing systems is essential to meet the ever-increasing computational demands of many scientific and industrial applications. Ibis allows easy programming and deployment of compu... 详细信息

关键词： distributed programming distributed systems Ibis Java Scientific computing systems engineering computational demands distributed computing systems industrial applications parallel computing systems parallel programming real-world distributed computer scientific applications

来源：评论

学校读者我要写书评

暂无评论

The Interaction Interface for the distributed computing System's Nodes 13

The Interaction Interface for the Distributed Computing Syst...

引用

13th International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE)

作者： Mishchenko, Polina V. Silov, Yan V. Beloborodova, Zoya E. Lykov, Alexey S. Novosibirsk State Tech Univ Dept Comp Engn Novosibirsk Russia

ISBN: (纸本)9781509040698

This article considers up-to-date problems of parallel computing systems development in Russia. The study describes an engineering of an interface for organization of high-performance system with programmable structure and for its partition to specific subsystems focused on applied tasks. The solution is based on the concept of homogeneous computing systems (HCS) relying on the model of collective of calculators. HCS concept was formulated in the Institute of Mathematics of the USSR under the leadership of E.V. Evreinov in 1962 [1]. The approach is particularly relevant in terms of growing popularity of information networks which combining numerous personal computers (PCs). It's obviously necessary to develop software tools to integrate disparate calculators into the system and identify the required number of sub-systems for specific problem solving. An interference into the hardware and software parts of the calculators must be avoided during the software development process. Programmable structure of the computer system is provided at the stage of unification of calculators into software subsystem interface called an agent of DCS PS. The experience of the development of the Interface organization of distributed computing systems with programmable structure and allocation of subsystems for specific applications. The software described in the present document has been tested while an experimental organization of the DCS PS at the department of the computer engineering of NSTU.

关键词： distributed computing systems parallel algorithm computing community TCP/IP client-server architecture

来源：评论

学校读者我要写书评

暂无评论

ObliDC: An SGX-based Oblivious distributed computing Framework with Formal Proof 19

ObliDC: An SGX-based Oblivious Distributed Computing Framewo...

引用

ACM Asia Conference on Computer and Communications Security (Asia CCS)

作者： Wu, Pengfei Shen, Qingni Deng, Robert. H. Liu, Ximeng Zhang, Yinghui Wu, Zhonghai Peking Univ Beijing Peoples R China Singapore Management Univ Singapore Singapore Fuzhou Univ Fuzhou Peoples R China Xian Univ Posts & Telecommun Xian Peoples R China

ISBN: (纸本)9781450367523

Data privacy is becoming one of the most critical concerns in cloud computing. Several proposals based on Intel SGX such as VC3 [1] and M2R [2] have been introduced in the literature to protect data privacy during job execution in the cloud. However, a comprehensive formal proof of their security guarantees is still lacking. In this paper, we propose ObliDC, a general UC-secure SGX-based oblivious distributed computing framework. First, we model the life-cycle of a distributed computing job as data-flow graphs. Under the assumption of malicious, adaptive adversaries in the cloud, we then formally define data privacy of a distributed computing job by introducing a notion named ODC-privacy, which encompasses both semantic security (to protect data confidentiality during computation and transmission) and oblivious traffic (to prevent data leakage from traffic analysis). ObliDC is composed of four two-party protocols - job deployment, job initialization, job execution, and results return, which allow for modular construction of concrete privacy-preserving job protocols in different distributed computing frameworks. Finally, inspired by a formal abstraction for trusted processors proposed by R. Pass et al. [3], we formally prove the security of ObliDC under the universal composability (UC) framework.

关键词： oblivious computation Intel SGX distributed computing systems formal proof

来源：评论

学校读者我要写书评

暂无评论

Allocating modelling resources in distributed model management systems

引用

Annals of Operations Research 1992年第1期38卷 397-419页

作者： Murthy, Ishwar Ghosh, Deb Moffett, Allen Quantitative Business Analysis Department Louisiana State University Baton Rouge 70803 LA United States

Due to the growing popularity of distributed computing systems and the increased level of modelling activity in most organizations, significant benefits can be realized through the implementation of distributed model management systems (DMMS). These systems can be defined as a collection of logically related modelling resources distributed over a computer network. In several ways, functions of DMMS are isomorphic to those of distributed database systems. In general, this paper examines issues viewed as central to the development of distributed model bases (DMB). Several criteria relevant to the overall DMB design problem are discussed. Specifically, this paper focuses on the problem of distributing decision models and tools (solvers), henceforth referred to as the Model Allocation Problem (MAP), to individual computing sites in a geographically dispersed organization. In this research, a 0/1 integer programming model is formulated for the MAP, and an efficient dual ascent heuristic is proposed. Our extensive computational study shows in most instances heuristic-generated solutions which are guaranteed to be within 1.5-7% of optimality. Further, even problems with 420 integer and 160,000 continuous variables took no more than 60 seconds on an IBM 3090-600E computer. © 1992 J.C. Baltzer AG, Scientific Publishing Company.

关键词： Decision support systems distributed computing systems integer programming model management

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：