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

A distributed file server FOR EMBEDDED APPLICATIONS

SOFTWARE ENGINEERING JOURNAL 1988年第5期3卷 142-148页

作者： MUKHERJEE, A KRAMER, J MAGEE, J ADV TECHNOL INST CALCUTTA 700064INDIA UNIV LONDON IMPERIAL COLL SCI & TECHNOL DEPT COMPLONDON SW7 2BZENGLAND

This paper describes the design and implementation of a distributed file system (dfs) for embedded applications. The services provided in dfs include transaction management, file management and file access. Client processes use message passing to access these services. The file system provides client processes with different types of files. These includereplicatedfiles, with identical copies stored at multiple nodes, andconsistentfiles, stored at a single node. Both are accessed only within transactions. Multiple readers or a single writer are allowed access to the files, and updates are performed atomically using a co-ordinated commit protocol over multiple sites. A novel concurrency control algorithm which provides deterministic response and avoids deadlock has been designed to resolve contention. Other types of file are also provided for low-overhead storage of less critical data. This paper motivates the need for different types of file, and describes the design and implementation of dfs using the CONIC programming environment for the construction of distributed systems.

关键词： file servers programming environments distributed processing concurrency control Computer networks and techniques CONIC programming environment protocols replicated files deterministic response transaction management distributed file server distributed systems consistent files file access embedded applications file organisation file organisation message passing Operating systems Programming support commit protocol file management

来源：评论

学校读者我要写书评

暂无评论

HOW TO DEAL WITH REPLICATION AND RECOVERY IN A distributed file server

HOW TO DEAL WITH REPLICATION AND RECOVERY IN A DISTRIBUTED F...

引用

4th International Conference on Software and Data Technologies

作者： Arrieta-Salinas, I. Juarez-Rodriguez, J. R. Armendariz-Inigo, J. E. Gonzalez de Mendivil, J. R. Univ Publ Navarra Dept Ingn Matemat & Informat Pamplona 31006 Spain

ISBN: (纸本)9789896740108

Data replication techniques are widely used for improving availability in software applications. Replicated systems have traditionally assumed the fail-stop model, which limits fault tolerance. For this reason, there is a strong motivation to adopt the crash-recovery model, in which replicas can dynamically leave and join the system. With the aim to point out some key issues that must be considered when dealing with replication and recovery, we have implemented a replicated file server that satisfies the crash-recovery model, making use of a Group Communication System. According to our experiments, the most interesting results are that the type of replication and the number of replicas must be carefully determined, specially in update intensive scenarios;and, the variable overhead imposed by the recovery protocol to the system. From the latter, it would be convenient to adjust the desired trade-off between recovery time and system throughput in terms of the service state size and the number of missed operations.

关键词： Replication Crash-Recovery Model Group Communication Systems Virtual Synchrony distributed file server Testing

来源：评论

学校读者我要写书评

暂无评论

Online Bounds on Balancing Two Independent Criteria with Replication and Reallocation

引用

IEEE TRANSACTIONS ON COMPUTERS 2012年第11期61卷 1601-1610页

作者： Tse, Savio S. H. Istanbul Univ Dept Comp Engn TR-34320 Istanbul Turkey

We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose three online approximate solutions for balancing their loads and required storage spaces upon placements. We first revisit the best existing solution for simple placement (i.e., without replication and reallocation), and rewrite it in our first algorithm by imposing some flexibilities. Our second algorithm is to apply document replication. The upper bound of load is significantly reduced, without sacrificing that of the storage space. This upper bound contains at least one special case which can never be outperformed by any online simple placement algorithms. Lastly, we show that there exists an online algorithm which allows very little document reallocation, but gives an upper bound result on the load and storage space, which is never reachable by any online algorithms for simple placement. The time complexities of the first two algorithms are in O(log M), and the last algorithm runs in O(log MN) time, where M is the number of servers, and N is the number of existing documents.

关键词： Approximate distributed online algorithm load balancing scheduling distributed file server document placement replication reallocation

来源：评论

学校读者我要写书评

暂无评论

Online Bicriteria Load Balancing Using Object Reallocation

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2009年第3期20卷 379-388页

作者： Tse, Savio S. H. Bilkent Univ Dept Comp Engn TR-06800 Ankara Turkey

We study the bicriteria load balancing problem on two independent parameters under the allowance of object reallocation. The scenario is a system of M distributed file servers located in a cluster, and we propose three online approximate algorithms for balancing their loads and required storage spaces during document placement. The first algorithm is for heterogeneous servers. Each server has its individual trade-off of load and storage space under the same rule of selection. The other two algorithms are for homogeneous servers. The second algorithm combines the idea of the first one and the best existing solution for homogeneous servers. Using document reallocation, we obtain a smooth trade-off curve of the upper bounds of load and storage space. The last one bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively;and more importantly, for each server, the value of at least one parameter is far from its worst case. The time complexities of these three algorithms are O(log M) plus the cost of document reallocation.

关键词： Scheduling distributed file server document placement heterogeneous computing nonuniform requirement

来源：评论

学校读者我要写书评

暂无评论

An implementation of a replicated file server supporting the crash-recovery failure model

引用

JOURNAL OF SUPERCOMPUTING 2012年第1期59卷 156-202页

作者： Arrieta-Salinas, Itziar Enrique Armendariz-Inigo, Jose Ramon Juarez-Rodriguez, Jose Ramon Gonzalez de Mendivil, Jose Univ Publ Navarra Dept Ingn Matemat & Informat Pamplona 31006 Spain

关键词： Replication protocols Crash-recovery model Group communication systems distributed file server State transition system Testing

来源：评论

学校读者我要写书评

暂无评论

Online Balancing Two Independent Criteria

Online Balancing Two Independent Criteria

引用

IFIP International Conference on Network and Parallel Computing

作者： Tse, Savio S. H. Bilkent Univ Dept Comp Engn TR-06800 Ankara Turkey

ISBN: (纸本)9783540881391

We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing their loads and required storage spaces. We first revisit the best existing solution for document placement, and rewrite it in our first algorithm by imposing some flexibilities. The second algorithm bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively;and more importantly, for each server, the value of at least one parameter is far from its worst case. The time complexities for both algorithm are O(log M).

关键词： Approximate distributed Online algorithm Load balancing Scheduling distributed file server Document placement

来源：评论

学校读者我要写书评

暂无评论

Design of Tower Management Software Based on Java language

Design of Tower Management Software Based on Java language

引用

2017 5th International Conference on Frontiers of Manufacturing Science and Measuring Technology(FMSMT 2017)

作者： Yingqi Zhao Sontian College of Guangzhou University

ISBN: (纸本)9781510840232

The wisdom of public security is an important part of the wisdom of the city, to mobilize the masses to patrol and control is the key of public security. In order to solve the difficult issue of people-management, need to promote the management technology of information by using the methods of science and technology, Internet. The tower-management system arises at the historic moment. The system is equipped with intelligent device, GIS information system, regional grid system, supporting the use of GPS positioning system and service monitoring command center, it can manage and dispatch all the people of the region for daily-scheduling. The kernel development kits of the system is based on Java language, combined with J2EE technology architecture, and mobile communication technology, database sharding technique, No SQL database technology, massive distributed file service technology. The tower management system includes web service terminal and mobile client app in two parts. The experimental results show that the system has the characteristics of safety, reliability, intelligence expansion, standard open, easy to use and so on.

关键词： Computer management system Spring MVC infrastructure distributed file server Java Language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：