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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

883 篇 会议
46 篇 期刊文献
12 册 图书
3 篇 学位论文

馆藏范围

944 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

413 篇 工学
- 396 篇 计算机科学与技术...
- 164 篇 软件工程
- 59 篇 电气工程
- 40 篇 信息与通信工程
- 29 篇 控制科学与工程
- 11 篇 动力工程及工程热...
- 9 篇 电子科学与技术（可...
- 9 篇 建筑学
- 9 篇 环境科学与工程（可...
- 8 篇 机械工程
- 4 篇 土木工程
- 3 篇 航空宇航科学与技...
- 3 篇 生物工程
- 2 篇 仪器科学与技术
- 2 篇 网络空间安全
151 篇 管理学
- 145 篇 管理科学与工程(可...
- 107 篇 工商管理
- 15 篇 图书情报与档案管...
58 篇 理学
- 40 篇 数学
- 10 篇 系统科学
- 7 篇 物理学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
12 篇 经济学
- 11 篇 应用经济学
- 1 篇 理论经济学
4 篇 法学
- 3 篇 社会学
- 1 篇 法学
2 篇 艺术学
- 2 篇 设计学（可授艺术学...
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学

主题

428 篇 resource managem...
229 篇 processor schedu...
111 篇 grid computing
107 篇 scheduling
95 篇 dynamic scheduli...
93 篇 distributed comp...
66 篇 computational mo...
65 篇 scheduling algor...
62 篇 computer science
55 篇 parallel process...
54 篇 computer archite...
53 篇 quality of servi...
49 篇 concurrent compu...
49 篇 large-scale syst...
48 篇 application soft...
44 篇 operating system...
44 篇 real time system...
43 篇 load management
40 篇 runtime
38 篇 cloud computing

机构

5 篇 inria
5 篇 department of co...
5 篇 colorado state u...
4 篇 school of comput...
4 篇 university of ch...
4 篇 tadaam team inri...
3 篇 college of compu...
3 篇 lawrence livermo...
3 篇 colorado state u...
3 篇 univ chicago dep...
3 篇 lawrence livermo...
3 篇 grid computing a...
3 篇 high performance...
3 篇 computer enginee...
3 篇 tech univ munich...
3 篇 university of cr...
3 篇 national laborat...
3 篇 institute of com...
3 篇 aristotle univ t...
2 篇 sun microsystems...

作者

6 篇 rajkumar buyya
6 篇 siegel howard ja...
5 篇 h.j. siegel
5 篇 maciejewski anth...
5 篇 buyya rajkumar
5 篇 t. kidd
5 篇 albert y. zomaya
4 篇 d.p. spooner
4 篇 s.a. jarvis
4 篇 carmen carrión
4 篇 koenig gregory a...
4 篇 g.r. nudd
4 篇 blanca caminero
4 篇 r. buyya
4 篇 nudd gr
4 篇 wentong cai
4 篇 trystram denis
4 篇 chen yong
4 篇 elmroth erik
4 篇 g. manimaran

语言

939 篇 英文
5 篇 其他

检索条件"任意字段=International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems"

共 944 条记录，以下是911-920 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Hybrid resource management algorithms for multicomputer systems

Hybrid resource management algorithms for multicomputer syst...

引用

Proceedings of the 8th international parallel Processing Symposium

作者： Baxter, Jeff J. Fu, John W.C. Ramkumar, B. Patel, Janak H. Intel Corp Santa Clara United States

ISBN: (纸本)0818656026

This paper addresses the issue of resource management in parallel systems. Two hybrid algorithms for general resource management in distributed memory computers are presented. T-hybrid is a decoupled algorithm that combines a static template allocation scheme with a low-cost local demand-driven dynamic algorithm while C-hybrid is a coupled algorithm that combines a simple static allocation scheme with the same dynamic algorithm as T-hybrid. A set of test programs is scheduled using these hybrid algorithms and compared with scheduling used pure static and dynamic schemes when executed on a Ncube2 system under the Chare Kernel. The results show that the two new hybrid strategies provide faster execution times than all the pure dynamic and static algorithms investigated and that the simpler C-hybrid algorithm resulted in about 6% faster execution time than T-hybrid and 22% faster than the fastest non-hybrid scheme.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Routing, scheduling, timing and intractability 1

Routing, scheduling, timing and intractability

引用

1st international Conference on Massively parallel Computing systems: The Challenges of General-Purpose and Special-Purpose Computing, MPCS 1994

作者： Németh, G. Technical University of Budapest Hungary

ISBN: (纸本)0818663227

The management of the various cooperation modes and timing requirements in the case of a large number of tasks poses interesting theoretical problems in massively parallel environments. These systems are in general fully distributed ones, preventing coherent observability. Moreover, their configurations may change dynamically because of failures and/or modifications. Thus no optimal algorithms can be constructed for the effective utilization of the resources available. The influence of the granularity level, cooperation modes and timing requirements are scrutinized in order to identify areas for further research. It is shown that the resource allocation procedure should be partitioned into distinct phases both in time and space. © 1994 IEEE.

关键词： scheduling

来源：评论

学校读者我要写书评

暂无评论

8th international workshop on distributed Algorithms, WDAG 1994

8th International Workshop on Distributed Algorithms, WDAG 1...

引用

8th international workshop on distributed Algorithms, WDAG 1994

ISBN: (纸本)9783540584490

The proceedings contain 26 papers. The special focus in this conference is on distributed Algorithms. The topics include: Replicated file management in large-scale distributed systems;secure distributed computing;fast increment registers;coping with contention;exotic behaviour of consensus numbers;space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable;linear-time snapshot using multi-writer multi-reader registers;fast, long-lived renaming;anomalies in the wait-free hierarchy;finding the extrema of a distributed multiset;the level of handshake required for establishing a connection;local labeling and resource allocation using preprocessing;a scalable approach to routing in ATM networks;low complexity network synchronization;an incremental distributed algorithm for computing biconnected components;uniform deterministic self-stabilizing ring-orientation on odd-length rings;using failure detectors to solve consensus in asynchronous shared-memory systems;an algorithm with optimal failure locality for the dining philosophers problem;average and randomized complexity of distributed problems;self-stabilization by local checking and global reset;breakpoints and time in distributed computations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TaskPair-scheduling: an approach for dynamic real-time systems

TaskPair-scheduling: an approach for dynamic real-time syste...

引用

workshop on parallel and distributed Real-Time systems

作者： H. Streich National Center for Computer Science (GMD) Research Division of Responsive Systems Saint Augustine Canada

In this paper an on-line scheduling approach called TaskPair-scheduling is presented which merges the concepts of guaranteeing (an activity) and exception handling (due to time-outs) such that the guarantee may enclose the execution of the exception handler. An on-line scheduling algorithm is shown which plans guaranteed try-except constructs as a pair of tasks (MainTask, ExceptTask) by considering the ExceptTask as a hard real-time task (task of maximum importance) and the MainTask by its relative importance (this may depend on arbitrary criteria). This leads to timely predictable behaviour even if the MainTask of the activity has an arbitrary execution time.< >

关键词： Real time systems Dynamic scheduling Processor scheduling scheduling algorithm Timing Computer science Operating systems Mars resource management Springs

来源：评论

学校读者我要写书评

暂无评论

2nd international workshop on Advanced Teleservices and High-Speed Communication Architectures, IWACA 1994

引用

2nd international workshop on Advanced Teleservices and High-Speed Communication Architectures, IWACA 1994

ISBN: (纸本)9783540584940

The proceedings contain 36 papers. The special focus in this conference is on Advanced Teleservices and High-Speed Communication Architectures. The topics include: A service kernel for multimedia endstations;advance reservation of network resources for multimedia applications;media scaling in distributed multimedia object services;an interactive cable television network for multimedia applications;eurescom IMS1 projects;hypermedia information retrieval system using MHEG coded representation in a networked environment;transparent ATM LAN interconnection over isdn;extending the rate-monotonic scheduling algorithm to get shorter delays;adaptation layer and group communication server for reliable multipoint services in ATM networks;a transport and internetworking package for ATM;multimedia and hypermedia synchronization: a unified framework;multimedia playout synchronization using buffer level control;optimal resource management in ATM transport networks supporting multimedia traffic;incorporating security functions in multimedia conferencing applications in the context of the mice project;secure multimedia applications and Teleservices - security requirements and prototype for health care;the BERKOM multimedia Teleservices;the CIO multimedia communication platform;from requirements to services: group communication support for distributed multimedia systems;harmonization of an infrastructure for flexible distance learning in Europe with CTA;multimedia teletutoring over a trans-European ATM network;a framework for synchronous Tele-cooperation;multimedia conferencing services in an open distributed environment;ISABEL experimental distributed cooperative work application over broadband networks;demonstrating image communication within open distributed environments and development of a multimedia archiving teleservice using the DFR standard.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hybrid resource management algorithms for multicomputer systems

Hybrid resource management algorithms for multicomputer syst...

引用

international Symposium on parallel Processing

作者： J.J. Baxter J.W.C. Fu B. Ramkumar J.H. Patel Intel Corporation Santa Clara CA USA Department of Elect. and Comp. Engineering University of Iowa Iowa IA USA Centre for Reliable and High-Perf. Comp. University of Illinois Urbana-Champaign Urbana IL USA

Addresses the issue of resource management in parallel systems. Two new hybrid algorithms for general resource management in distributed memory computers are presented. T-hybrid is a decoupled algorithm that combines a static template allocation scheme with a low-cost local demand-driven dynamic algorithm while C-hybrid is a coupled algorithm that combines a simple static allocation scheme with the same dynamic algorithm as T-hybrid. A set of test programs is scheduled using these hybrid algorithms and compared with scheduling using pure static and dynamic schemes when executed on an Ncube2 system under the Chare Kernel. The results show that the two new hybrid strategies provide faster execution times than all the pure dynamic and static algorithms investigated, and that the simpler C-hybrid algorithm resulted in an execution time about 6% faster than T-hybrid and 22% faster than the fastest non-hybrid scheme.< >

关键词： resource management Heuristic algorithms Memory management Costs Processor scheduling Dynamic scheduling Educational institutions Cities and towns distributed computing System testing

来源：评论

学校读者我要写书评

暂无评论

Achieving dependability in mission-critical operating systems through adaptability and large-scale functional integration

Achieving dependability in mission-critical operating system...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： H.F. Wedde J. Lind A. Eiss Informatik III University of Dortmund Dortmund Germany

As part of the DRAGON SLAYER project, the adaptive and reliable distributed file system MELODY has emerged for supporting hard real-time applications in unpredictable environments. In MELODY, the time criticality of tasks and their sensitivity with respect to the latest file information are explicitly used for novel, flexible task scheduling algorithms and file replication management policies, featuring dynamic file replication and relocation of file copies as well as offering file versions of varying recency. The achieved adaptability far outweighs the additional overhead in comparison to simpler models, and enhances both reliability and real-time responsiveness for file access. Both the development of the model and the experimental analysis at the various stages were done in an incremental manner. This was necessary in order to cope with the complexity of the problems resulting from conflicting requirements and dynamic trade-offs (e.g. real-time responsiveness vs. reliability). As the next incremental model extension, and as the major contribution of this paper, a series of integration policies are developed for task and resource scheduling, after redefining the role and order of task and resource scheduling: the periodic and dynamic models (and combinations thereof) are used to invoke the task scheduler for a fixed interval of time. All of these policies compare very convincingly against the "classical" model where the task scheduler only schedules tasks after their resources have been allocated. The results are discussed.

关键词： Mission critical systems Operating systems Large-scale systems Job shop scheduling Dynamic scheduling Large scale integration File systems Delay Real time systems scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Routing, scheduling, timing and intractability

Routing, scheduling, timing and intractability

引用

international Conference on Massively parallel Computing systems

作者： G. Nemeth Technical University of Budapest Hungary

关键词： Routing Timing Hardware Observability Real time systems Environmental management Partitioning algorithms resource management Communication system control History

来源：评论

学校读者我要写书评

暂无评论

An algorithm with optimal failure locality for the dining philosophers problem 8th

An algorithm with optimal failure locality for the dining ph...

引用

8th international workshop on distributed Algorithms, WDAG 1994

作者： Tsay, Yih-Kuen Bagrodia, Rajive L. Department of Computer Systems Uppsala University P.O. Box 325 UppsalaS-751 05 Sweden Computer Science Department University of California Los Angeles United States

ISBN: (纸本)9783540584490

This paper presents an algorithm for the dining philosophers problem with a failure locality of two, i.e. in the presence of undetectable fail-stop failures, the algorithm guarantees that a process is free from starvation if no processes that are within two hops away from the process fail. It can be shown that any non-probabilistic algorithm for the problem has a failure locality of at least two;hence, the failure locality of our algorithm is optimal. Our algorithm combines the idea of a dynamic priority scheme with the use of a preemptive fork collecting strategy. Its response time is O(n), where n is the total number of processes, if no failures actually occur or O(n2) in the presence of failures. As an application, we show how the algorithm can be used to derive a scheduling algorithm for the synchronization of CSP-like processes that is strongly fair and has a failure locality of three. © 1994, Springer Verlag. All rights reserved.

关键词： resource allocation

来源：评论

学校读者我要写书评

暂无评论

resource management for distributed parallel systems 2

Resource management for distributed parallel systems

引用

2nd international Symposium on High Performance distributed Computing, HPDC 1993

作者： Neuman, B.C. Rao, S. Inf. Sci. Inst. Univ. of Southern California Los AngelesCA United States

ISBN: (纸本)0818639008

Multiprocessor systems should exist in the larger context of distributed systems, allowing multiprocessor resources to be shared by those that need them. Unfortunately, typical multiprocessor resource management techniques do not scale to large networks. The Prospero resource Manager (PRM) is a scalable resource allocation system that supports the allocation of processing resources in large networks and multiprocessor systems. To manage resources in such distributed parallel systems, PRM employs three types of managers: system managers, job managers, and node managers. There exist multiple independent instances of each type of manager, reducing bottlenecks. The complexity of each manager is further reduced because each is designed to utilize information at an appropriate level of abstraction. © 1993 IEEE.

关键词： Managers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共95页 << < 86 87 88 89 90 91 92 93 94 95 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：