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

Proceedings of the workshop on Object-Oriented Real-Time Dependable systems (WORDS) 1999年 34-39页

作者： Wolfe, Victor Fay DiPippo, Lisa C. Bethmagalkar, Ramachandra Cooper, Gregory Johnston, Russell Kortmann, Peter Watson, Ben Wohlever, Steven Univ of Rhode Island Kingston RI United States

ISBN: (纸本)076950101X

This paper presents a real-time CORBA scheduling Service called RapidSched. RapidSched uses a global, distributed deadline monotonic priority assignment, enforcement of priorities by commercial real-time operating systems, and distributed priority ceiling resource management. RapidSched is integrated with an enhanced version of the PERTS real-time analysis tool.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Nomad: a scalable operating system for clusters of uni- and multiprocessors

Nomad: a scalable operating system for clusters of uni- and ...

引用

IEEE international Conference on Cluster Computing

作者： E. Pinheiro R. Bianchini COPPE Systems Engineering Federal University of Rio de Janeiro Rio de Janeiro Brazil Department of Computer Science University of Rochester Rochester NY USA

The recent improvements in workstation and interconnection network performance have popularized the clusters of off-the-shelf workstations. However, the usefulness of these clusters is yet to be fully exploited, mostly due to the inadequate management of cluster resources implemented by current distributed operating systems. In order to eliminate this problem and approach the computational power of large clusters of workstations, in this paper we propose Nomad, an efficient operating system for clusters of uni and/or multiprocessors. Nomad includes several important characteristics for modern cluster-oriented operating systems: scalability, efficient resource management across the cluster, efficient scheduling of parallel and distributed applications, distributed I/O, fault detection and recovery, protection, and backward compatibility. Some of the mechanisms used by Nomad, such as process checkpointing and migration, can be found in previously proposed systems. However, our system stands out for its strategy for disseminating information across the cluster and its efficient management of all cluster resources. In addition, Nomad is highly scalable as it uses neither centralized control nor extra messages to implement its functionality, taking advantage of the I/O traffic associated with its distributed file system. Our preliminary evaluation of the load balancing aspect of Nomad shows that the pattern of file accesses in our distributed Ale system allows for efficient and scalable load balancing. Our main conclusion is that the complete implementation of Nomad will most likely be efficient and will be a nice platform for future research on operating systems for clusters of workstations.

关键词： Operating systems Workstations resource management Load management Multiprocessor interconnection networks Power system management Scalability Processor scheduling Fault detection Protection

来源：评论

学校读者我要写书评

暂无评论

Task rescheduling in multi-agent manufacturing

Task rescheduling in multi-agent manufacturing

引用

international workshop on Database and Expert systems Applications

作者： M. Fletcher S. Misbah Deen Computer Science Department University of Keele Staffordshire UK

We present a model for task rescheduling in multi-agent manufacturing that is geared toward maximising system efficiency and reliability in an environment with predictable failure patterns. We describe a distributed manufacturing system architecture (http://***/public/***) to illustrate the merits of rescheduling. We also develop an action redistribution framework based upon resource cooling, i.e. migrating actions from the most utilised or faulty (hottest) agents' resources to the coldest (least constrained) ones. Furthermore, the paper discusses the costs versus benefits of resource cooling when rescheduling cascades over parallel resources executing a decentralised production task.

关键词： Manufacturing systems Cooling Job shop scheduling resource management Automatic control Production Flexible manufacturing systems Control systems Remotely operated vehicles Databases

来源：评论

学校读者我要写书评

暂无评论

RapidSched: static scheduling and analysis for real-time CORBA

RapidSched: static scheduling and analysis for real-time COR...

引用

international workshop on Object Orientation in Operating systems

作者： Wolfe DiPippo Bethmagalkar Cooper Johnston Kortmann Watson Wohlever University of Rhode Island Kingston RI USA SPAWAR Systems Center San Diego CA USA Tri-Pacific Software Alameda CA USA MITRE Corporation Bedford MA USA

The paper presents a real time CORBA scheduling Service called RapidSched. RapidSched uses a global, distributed deadline monotonic priority assignment, enforcement of priorities by commercial real time operating systems, and distributed priority ceiling resource management. RapidSched is integrated with an enhanced version of the PERTS real time analysis tool.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

A network status predictor to support dynamic scheduling in network-based computing systems

A network status predictor to support dynamic scheduling in ...

引用

international Symposium on parallel Processing

作者： JunSeong Kim D.J. Lilja Electrical and Computer Engineering and Minnesota Supercomputing Institute University of Minnesota Minneapolis MN USA

The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth requirements, and the difficulty of predicting the system network load. To help address this deficiency and thereby support dynamic network resource scheduling, we propose the network status predictor (NSP). This tool is a general and extensible network load monitor that introduces lower and upper latency prediction bounds. We evaluate its ability to dynamically predict TCP/IP end-to-end latency, with varying network loads using a cluster of SGI multiprocessors interconnected with a fibre channel network. Our results show that a combination of numerical predictors can be dynamically selected based on the network's recent state to produce better predictions than when using a single predictor alone.

关键词： Dynamic scheduling Intelligent networks Computer networks Delay Monitoring Processor scheduling resource management Accuracy History Engineering management

来源：评论

学校读者我要写书评

暂无评论

An efficient resource allocation scheme for gang scheduling

An efficient resource allocation scheme for gang scheduling

引用

IEEE international Conference on Cluster Computing

作者： B.B. Zhou P. Mackerras C.W. Johnson D. Walsh R.P. Brent ANU-Fujitsu CAP Project Australian National University Canberra ACT Australia Department of Computer Science Australian National University Canberra ACT Australia Computing Laboratory Oxford University Oxfordshire UK

Gang scheduling is currently the most popular scheduling scheme for parallel processing in a time shared environment. One major drawback of using gang scheduling is the problem of fragmentation. The conventional method to alleviate this problem is to allow jobs running in multiple time slots. However our experimental results show that simply applying this method alone cannot solve the problem of fragmentation, but on the contrary it may eventually degrade the efficiency of system resource utilisation. In this paper we introduce an efficient resource allocation scheme which effectively incorporates the ideas of re-packing jobs, running jobs in multiple slots and minimising time slots into the buddy allocation system to significantly improve the system and job performance. Because there is no process migration involved in job re-packing, this scheme is particularly suitable for clustered parallel computing systems.

关键词： resource management Processor scheduling parallel processing Time sharing computer systems Centralized control Australia Computer science Laboratories Hardware Software performance

来源：评论

学校读者我要写书评

暂无评论

Network Status Predictor to support dynamic scheduling in network-based computing systems

Proceedings of the International Parallel Processing Symposi...

引用

Proceedings of the international parallel Processing Symposium, IPPS 1999年 372-378页

作者： Kim, JunSeong Lilja, David J. Univ of Minnesota Minneapolis United States

The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth requirements, and the difficulty of predicting the system network load. To help address this deficiency, and thereby support dynamic network resource scheduling, we propose the Network Status Predictor (NSP). This tool is a general and extensible network load monitor that introduces lower and upper latency prediction bounds. We evaluate its ability to dynamically predict TCP/IP end-to-end latency with varying network loads using a cluster of SGI multiprocessors interconnected with a Fibre Channel network. Our results show that a combination of numerical predictors can be dynamically selected based on the network's recent state to produce better predictions than when using a single predictor alone.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Why the mean is inadequate for accurate scheduling decisions

Why the mean is inadequate for accurate scheduling decisions

引用

international Symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： T. Kidd D. Hensgen Naval Postgraduate School Monterrey CA USA

In a distributed environment, the generalized scheduling problem attempts to optimize some performance criteria by assigning tasks to resources and by determining the order in which those tasks will be executed. Although most resource management systems in use today have the goal of maximizing the use of idle processors, several, such as LSF and SmartNet attempt to minimize the time at which the last job, in each set of jobs, completes. They attempt to deliver better quality of service to jobs by using scheduling heuristics that calculate schedules based upon the expected run-times of each job on each machine. This paper analyzes an exhaustive scheduling algorithm that minimizes the time at which the last job completes, if all jobs execute for exactly their expected run-limes. The authors show that if this assumption is violated, that is, if jobs do not execute for exactly their expected run-times, then this algorithm will underestimate the time at which the last job is exacted to finish, sometimes substantially. The authors conclude that an algorithm that uses not only the expected run-times, but also their distributions, can obtain better schedules.

关键词： Processor scheduling Runtime resource management scheduling algorithm Load management Quality of service Algorithm design and analysis Computer science Contracts Protocols

来源：评论

学校读者我要写书评

暂无评论

Why the mean is inadequate for accurate scheduling decisions

Proceedings of the International Symposium on Parallel Archi...

引用

Proceedings of the international Symposium on parallel Architectures, Algorithms and Networks, I-SPAN 1999年 262-267页

作者： Kidd, Taylor Hensgen, Debra Naval Postgraduate Sch Monterey United States

In a distributed environment, the generalized scheduling problem attempts to optimize some performance criteria by assigning tasks to resources and by determining the order in which those tasks will be executed. Although most resource management systems in use today have the goal of maximizing the use of idle processors, several, such as LSF and SmartNet, attempt to minimize the time at which the last job, in each set of jobs, completes. They attempt to deliver better quality of service to jobs by using scheduling heuristics that calculate schedules based upon the expected run-times of each job on each machine. This paper analyzes an exhaustive scheduling algorithm that minimizes the time at which the last job completes, if all jobs execute for exactly their expected run-times. The authors show that if this assumption is violated, that is, if jobs do not execute for exactly their expected run-times, then this algorithm will underestimate the time at which the last job is expected to finish, sometimes substantially. The authors conclude that an algorithm that uses not only the expected run-times, but also their distributions, can obtain better schedules.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the performance of multithreaded Cilk runtime system on SMP clusters

Evaluation of the performance of multithreaded Cilk runtime ...

引用

IEEE international Conference on Cluster Computing

作者： Liang Peng Mingdong Feng Chung-Kwong Yuen School of Computing National University of Singapore Singapore

ISBN: (纸本)0769503438

Multithreading is widely accepted in shared memory systems such as the symmetric multiprocessor (SMP) machine. However in the clustering environment, multithreading is considered expensive and difficult. Process is still used as the basic scheduling unit in the majority of parallel programming systems on clusters. To investigate the overhead a runtime system may have in supporting multithreading, an extended multithreaded Cilk runtime system called distributed Cilk, was evaluated on a cluster of SMP PCs. The distributed Cilk embodies the algorithmic features of the Cilk language, supports software distributed shared memory (DSM) for all Cilk threads in the cluster and provides user-level cluster-wide locking. The performance of the distributed Cilk was evaluated using three problems which were parallelized with different strategies to represent various parallel programming paradigms. The results were also compared with those of Tread-Marks, a typical software DSM implementation for clusters with no support for multithreading. The experiments show that multithreading Cilk programs written in a divide-and-conquer fashion with good data locality can achieve comparable performance with the corresponding multiple-process Tread-Marks programs. The results shed light on efficient multithreading for clusters.

关键词： Yarn parallel processing parallel programming Multithreading Cost accounting Programming environments Concurrent computing Operating systems Load management Software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：