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

international Conference on parallel and distributed systems (ICPADS)

作者： M. Lin L. Karlsson L.T. Yang Department of Computer Science Linköping University Linkoping Sweden Department of Computer Science Saint Francis Xavier University Antigonish NS Canada

scheduling real-time computation is an extremely important activity in real-time systems, since it is the phase in which we assign the final temporal properties of the computations. The problem of allocating the resources in real-time systems creates an additional dimension within the conventional allocation problem, that of time constraints. The scheduling problem has been extensively examined in the literature. But optimization of valid schedules is an NP-hard problem, even for simple cases. Therefore, heuristic approaches seem appropriate to these classes of problems. In this paper, we investigate scheduling problems with certain kinds of temporal constraints and how these problems can be solved with the techniques of tabu search and genetic algorithms.

关键词： Processor scheduling Real time systems Computer science resource management Time factors NP-hard problem Genetic algorithms Constraint optimization Heuristic algorithms scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Gang scheduling with memory considerations

Gang scheduling with memory considerations

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： A. Batat D.G. Feitelson School of Computer Science and Engineering Hebrew University of Jerusalem Jerusalem Israel

A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job's processes. An alternative is to impose admission controls, and only admit jobs that fit into the available memory. Despite suffering from delayed execution, this leads to better overall performance by preventing the harmful effects of paging and thrashing.

关键词： Processor scheduling Delay resource management Operating systems Yarn Computer science Read only memory Electrical capacitance tomography Quality of service Data structures

来源：评论

学校读者我要写书评

暂无评论

A method of multi-PERT system for parallel jobshop management

A method of multi-PERT system for parallel jobshop managemen...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： H. Sugihara H. Koizumi N. Kataoka T. Takahara Nagoya Works Mitsubishi Electric Corporation Limited Nagoya Japan Departmentof Comp.Sys.Eng Tokyo Denki University Hatoyama Japan Info. Tech.Research & Development Center Mitsubishi Electric Corporation Limited Kamakura Japan Info.Sys. Works Mitsubishi Electric Corporation Limited Kamakura Japan

Conflicts between jobs for shared resources happen daily on the manufacturing floor of a jobshop production facility. This makes the management of a manufacturing floor rather difficult. In order to solve this problem, we are proposing a system to plan and manage scheduling through the use of multi-PERT. We call this system the Concurrent scheduling Method (CSM). Under CSM, the job structure of each individual order is clarified during the design stage to determine the production process. The result is detailed in CSM process charts similar to PERT diagrams. These multiplexed job structures are monitored in order to follow the progress and the schedule for all orders is planned and managed. A schedule planned in this way is able to have the resource utilization maximized fully and the critical path identified clearly. The information regarding the critical path helps to solve the load problem. In this way, the production process of the site is optimized for keeping the delivery date. Also, status changes caused by new orders, delivery date change requests or progress changes can be responded to quickly.

关键词： Job shop scheduling Production facilities Job production systems resource management Job design Monitoring Constraint theory Production planning Manufacturing industries Machine tools

来源：评论

学校读者我要写书评

暂无评论

A QoS performance measure framework for distributed heterogeneous networks

A QoS performance measure framework for distributed heteroge...

引用

Euromicro workshop on parallel and distributed Processing

作者： Jong-Kook Kim D.A. Hensgen T. Kidd H.J. Siegel D. St. John C. Irvine T. Levin N.W. Porter V.K. Prasanna R.F. Freund ECE School Purdue University West Lafayette IN USA CS and ECE Departments Naval Postgraduate School Monterrey CA USA Anteon Corporation Monterrey CA USA Department of EE-Systems University of Southern California Los Angeles CA USA NOEMIX Inc. San Diego CA USA

ISBN: (纸本)0769505007

In a distributed heterogeneous computing environment, users' tasks are allocated resources to simultaneously satisfy, to varying degrees, the tasks' different, and possibly conflicting, quality of service (QoS) requirements. When the total demand placed on system resources by the tasks, for a given interval of time, exceeds the resources available, some tasks will receive degraded service or no service at all. One part of a measure to quantify the success of a resource management system (RMS) in such a distributed environment is the collective value of the tasks completed during an interval of time, as perceived by the user, application, or policy maker. The flexible integrated system capability (FISC) ratio introduced here is a measure for quantifying this collective value. The FISC ratio is a multi-dimensional measure, and may include priorities, versions of a task or data, deadlines, situational mode, security, application- and domain-specific QoS, and dependencies. In addition to being used for evaluating and comparing RMS, the FISC ratio can be incorporated as part of the objective function in a system's scheduling heuristics.

关键词： Degradation resource management Indium tin oxide Computer networks Reactive power Time measurement Q measurement ISO Contracts Quality of service

来源：评论

学校读者我要写书评

暂无评论

Effective load sharing on heterogeneous networks of workstations

Effective load sharing on heterogeneous networks of workstat...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Li Xiao Xiadong Zhang Yanxia Qu Department of Computer Science College of William and Mary Williamsburg VA USA Bell Laboratories Lucent Technologies Inc. Holmdel NJ USA

We consider networks of workstations which are not only time-sharing, but also heterogeneous with a large variation in the computing power and memory capacities of different workstations. Many load sharing schemes mainly target sharing CPU resources, and have been intensively evaluated in homogeneous distributed environments. However the penalties of data accesses and movement in modern computer systems, such as page faults, have grown to the point where the overall performance of distributed systems cannot be further improved without serious considerations concerning memory resources in the design of load sharing policies. Considering both system heterogeneity and effective usage of memory resources, we design and evaluate load sharing policies in order to minimize both CPU idle times and the number of page faults in heterogeneous distributed systems. Conducting trace-driven simulations, we show that load sharing policies considering both CPU and memory resources are robust and effective in heterogeneous systems. We also show that the functionality and the nature of load sharing policies are quite independent on several memory demand distributions of workloads.

关键词： Workstations Memory management Computer science Educational institutions Time sharing computer systems Sun resource management Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Near fine grain parallel processing using static scheduling on single chip multiprocessors

Near fine grain parallel processing using static scheduling ...

引用

international workshop on Innovative Architecture for Future Generation High-Performance Processors and systems

作者： K. Kimura H. Kasahara Department of Electrical Electronics and Computer Engineering Waseda University Shinju Tokyo Japan

With the increase of the number of transistors integrated on a chip, efficient use of transistors and scalable improvement of effective performance of a processor are getting important problems However, it has been thought that popular superscalar and VLIW world have difficult to obtain scalable improvement of effective performance in future because of the limitation of instruction level parallelism. To cope with this problem, a single chip multiprocessor (SCM) approach with multi grain parallel processing inside a chip, which hierarchically exploits loop parallelism and coarse grain parallelism among subroutines, loops and basic blocks in addition to instruction level parallelism, is thought one of the most promising approaches. This paper evaluates effectiveness of the single chip multiprocessor architectures with a shared cache, global registers, distributed shared memory and/or local memory for near fine grain parallel processing as the first step of research on SCM architecture to support multi grain parallel processing. The evaluation shows OSCAR (Optimally Scheduled Advanced Multiprocessor) architecture having distributed shared memory and local memory in addition to centralized shared memory and attachment of global register gives us significant speed rip such as 13.8% to 143.8% for four processors compared with shared cache architecture for applications which have been difficult to extract parallelism effectively.

关键词： parallel processing Algorithms Registers Computer architecture Processor scheduling VLIW Uniform resource locators Microprocessors Yarn Costs

来源：评论

学校读者我要写书评

暂无评论

The cycle server: a Web platform for running parallel Monte Carlo applications on a heterogeneous Condor pool of workstations

The cycle server: a Web platform for running parallel Monte ...

引用

international Conference on parallel Processing workshops (ICPPW)

作者： M. Zhou M. Mascagni Program in Scientific Computing University of Southern Mississippi Hattiesburg MS USA Department of Computer Science Florida State University Tallahassee FL USA

We have developed a scientific computing tool which we call the cycle server This tool enables Monte Carlo computations on the Condor cycle scavenging system. The tool presents users with a graphical Web interface which hides the complexity of distributed computing from users. Users need only upload codes and download results via the Web GUI anywhere there is Web access. parallel random number support (via SPRNG random number library), running tasks on heterogeneous platforms (via the remote compiler), and using Condor to migrate jobs from busy or dead machines to idle ones, are all integrated seamlessly with the tool and are transparent to the user. At the same time, the cycle server acts as a gate-keeper for the workstation pool. No user accounts are needed on pool computers, and jobs only run at otherwise idle times without accessing local file systems. We show the utility of the cycle server on a large Monte Carlo computation from biochemical physics.

关键词： Monte Carlo methods Workstations Computer errors resource management Hard disks Scientific computing Concurrent computing distributed computing Graphical user interfaces Libraries

来源：评论

学校读者我要写书评

暂无评论

Enhancing NWS for use in an SNMP managed Internetwork

Proceedings of the International Parallel Processing Symposi...

引用

Proceedings of the international parallel Processing Symposium, IPPS 2000年 506-511页

作者： Busby Jr., Robert E. Neilsen, Mitchell L. Andresen, Daniel AT&T Network Operations Bridgeton United States

The Network Weather Service (NWS) is a distributed resource monitoring and utilization prediction system, employed as an aid to scheduling jobs in a metacomputing environment. We have enhanced the Network Weather Service by providing a broader metric set, forecast trend visualization, and asynchronous notification. Three new components have been added to the NWS system. The first of these is an SNMP Sensor that may be used to collect data being tracked by SNMP agents. Secondly, a Notification Process provides asynchronous events to interested applications when metrics tracked by NWS are expected to exceed established normal ranges. Finally, an extended SNMP agent daemon has been developed to provide SNMP-enabled applications with the ability to retrieve information from NWS without the need for custom programming. The new modules help to position NWS as an integral component for performing QoS monitoring and fault prediction in an SNMP-based fault management architecture. We also demonstrate that the additional functionality adds a minimal amount of overhead to the system, and reported bandwidth utilization correlates closely with results from the invasive NWS bandwidth sensor.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

resource management in legion

引用

FUTURE GENERATION COMPUTER systems-THE international JOURNAL OF ESCIENCE 1999年第5-6期15卷 583-594页

作者： Chapin, SJ Katramatos, D Karpovich, J Grimshaw, A Univ Virginia Sch Engn & Appl Sci Dept Comp Sci Charlottesville VA 22903 USA

The recent development of gigabit networking technology, combined with the;proliferation of low-cost, high-performance microprocessors, has given rise to metacomputing environments. These environments can combine many thousands of hosts, from hundreds of administrative domains, connected by transnational and world-wide networks. Managing the resources in such a system is a complex task, but is necessary to efficiently and economically execute user programs. In this paper, we describe the resource management portions of the Legion metacomputing system, including the basic model and its implementation. These mechanisms are flexible both in their support for system-level resource management but also in their adaptability for user-level scheduling policies. We show this by implementing a simple scheduling policy and demonstrating how it can be adapted to more complex algorithms. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： parallel and distributed systems task scheduling resource management autonomy

来源：评论

学校读者我要写书评

暂无评论

Predictive resource management for meta-applications

引用

FUTURE GENERATION COMPUTER systems-THE international JOURNAL OF ESCIENCE 1999年第5-6期15卷 723-734页

作者： Floros, N Hey, AJG Meacham, KE Papay, J Surridge, M Univ Southampton Parallel Applicat Ctr Southampton SO16 7NP Hants England

This paper defines meta-applications as large, related collections of computational tasks, designed to achieve a specific overall result, running on a (possibly geographically) distributed, non-dedicated mete-computing platform. To carry out such applications in an industrial context, one requires resource management and job scheduling facilities (including capacity planning), to ensure that the application is feasible using the available resources,that each component job will be sent to an appropriate resource, and that everything will finish before the computing resources are needed for other purposes. This requirement has been addressed by the PAC in three major European collaborative projects: PROMENVIR, TOOL-SHED and HPC-VAO, leading to the creation of job scheduling software, in which scheduling is brought together with performance modelling of applications and systems, to provide meta-applications management facilities. This software is described, focusing on the performance modelling approach which was needed to support it. Early results from this approach are discussed, raising some new issues in performance modelling and software deployment for meta-applications. An indication is given about ongoing work at the PAC designed to overcome current limitations and address these outstanding issues. (C) 1999 Published by Elsevier Science B.V. All rights reserved.

关键词： resource management meta-application performance modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：