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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是431-440 订阅

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

详细简洁

排序：

Meta-scheduling in advance using red-black trees in heterogeneous Grids

Meta-scheduling in advance using red-black trees in heteroge...

引用

IEEE international Symposium on parallel and distributed Processing workshops and Phd Forum (IPDPSW)

作者： Luis Tomás Carmen Carrión Blanca Caminero Agustín Caminero Department of Computing Systems University of Castilla La Mancha Albacete Spain Department of Communication and Control Systems National University of Distance Education (UNED) Madrid Spain

ISBN: (纸本)9781424465330

The provision of Quality of Service in Grid environments is still an open issue that needs attention from the research community. One way of contributing to the provision QoS in Grids is by performing meta-scheduling of jobs in advance, that is, jobs are scheduled some time before they are actually executed. In this way, the aproppriate resources will be available to run the job when needed, so that QoS requirements (i.e., deadline) are met. This paper presents two new techniques, implemented over the red-black tree data structure, to manage the idle/busy periods of resources. One of them takes into account the heterogeneity of resources when estimating the execution times of jobs. A performance evaluation using a real testbed is presented that illustrates the efficiency of this approach to meet the QoS requirements of users.

关键词： Quality of service resource management Control systems Dynamic scheduling Bandwidth Runtime Grid computing Communication system control Distance learning Tree data structures

来源：评论

学校读者我要写书评

暂无评论

Open manufacturing control with agile reconfiguring of robot services

Open manufacturing control with agile reconfiguring of robot...

引用

IEEE international workshop on Robotics in Alpe-Adria-Danube Region (RAAD)

作者： Th. Borangiu S. Răileanu D. Trentesaux T. Berger Dept. of Automatic Control & Applied Informatics University Politehnica of Bucharest Bucharest Romania University Lille Nord of France TEMPO Laboratory Valenciennes France

The paper describes a new, open control paradigm for discrete, repetitive shop floor production, designed as a solution for agile manufacturing reengineering through (a) multi-agent robot service reconfiguring and (b) implementing the robot service access model (RSAM) in a distributed, semi-heterarchical production planning, scheduling and execution control architecture. This distributed architecture integrates two layers with generic functionalities: (1) Dynamic reconfiguring of the resource (robot-vision) service access model RSAM through a multi-agent system organization; (2) Holonic manufacturing scheduling (robot allocation), control and tracking based on the PROSA holarchy and the Intelligent Product technology - implemented through intelligent embedded devices (acting as Active Holon Entities) which use OpenEmbedded Linux as real-time operating system. Experimental results are reported from production scenarios tested in the two shop-floor platforms of the Laboratories AIP-PRIMECA (University of Valenciennes) and CIMR (University Politehnica of Bucharest) composed by robot-vision workstations.

关键词： Agile manufacturing Intelligent robots Job shop scheduling Production planning Multiagent systems Virtual manufacturing Dynamic scheduling resource management Robot control Linux

来源：评论

学校读者我要写书评

暂无评论

ADEPT scalability predictor in support of adaptive resource allocation

ADEPT scalability predictor in support of adaptive resource ...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Arash Deshmeh Jacob Machina Angela Sodan School of Computer Science University of Windsor Windsor Canada

Adaptive resource allocation with different numbers of machine nodes provides more flexibility and significantly better potential performance for local job and grid scheduling. With the emergence of parallel computing in every-day life on multi-core systems, such schedulers will likely increase in practical relevance. A major reason why adaptive schedulers are not yet practically used is lacking knowledge of the scalability curves of the applications. Existing white-box approaches for scalability prediction are too expensive to apply them routinely. We present ADEPT, a speedup and runtime prediction tool, which is inexpensive and easy-to-use. ADEPT employs a black-box model and can be practically applied at large scale without user or administrator involvement. ADEPT requires neither program analysis and measurements nor user guesses but makes highly accurate predictions with only few observations of application runtime over different numbers of nodes/cores. ADEPT performs efficient model fitting by introducing an envelope-derivation technique to constrain the search. Additionally, ADEPT is capable of handling deviations from the underlying model by detection and automatic correction of anomalies via a fluctuation metric and by considering specific scalability patterns via multi-phase modeling. ADEPT also performs reliability judgment with potential proposal for placement of additional observations. Using MPI and OpenMP implementations of the NAS benchmarks and seven real applications, we demonstrate the effectiveness and high prediction accuracy of ADEPT for both speedup and runtime prediction, including interpolative and extrapolative cases, and show the capability of ADEPT to successfully handle special cases.

关键词： Scalability resource management Processor scheduling Runtime parallel processing Adaptive scheduling Large-scale systems Fluctuations Proposals Accuracy

来源：评论

学校读者我要写书评

暂无评论

Versatile Stack management for Multitasking Sensor Networks

Versatile Stack Management for Multitasking Sensor Networks

引用

IEEE international Conference on distributed Computing systems

作者： Rui Chu Lin Gu Yunhao Liu Mo Li Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Department of Computer Science and Engineering Hong Kong University of Science and Technology

ISBN: (纸本)9781424472611;9780769540597

The networked application environment has motivated the development of multitasking operating systems for sensor networks and other low-power electronic devices, but their multitasking capability is severely limited because traditional stack management techniques perform poorly on small-memory systems. In this paper, we show that combining binary translation and a new kernel runtime can lead to efficient OS designs on resource-constrained platforms. We introduce SenSmart, a multitasking OS for sensor networks, and present new OS design techniques for supporting preemptive multi-task scheduling, memory isolation, and versatile stack management. We have implemented SenSmart on MICA2/MICAz motes. Evaluation shows that SenSmart performs efficient binary translation and demonstrates a significantly better capability in managing concurrent tasks than other sensornet operating systems.

关键词： parallel PROCESSING (COMPUTERS) Sensor networks Electron devices Furnace conveyors Cache Memory System Operating systems osmium

来源：评论

学校读者我要写书评

暂无评论

On Better Performance from scheduling Threads According to resource Demands in MMMP

On Better Performance from Scheduling Threads According to R...

引用

international Conference on parallel Processing workshops (ICPPW)

作者： Lichen Weng Chen Liu Computer Architecture and Microprocessor Engineering Laboratory (CAMEL) Department of Electrical and Computer Engineering Florida International University Miami FL USA

The Multi-core Multi-threading Microprocessor introduces not only resource sharing to threads in the same core, e.g., computation resources and private caches, but also isolates those resources within different cores. Moreover, when the Simultaneous Multithreading architecture is employed, the execution resources are fully shared among the concurrently executing threads in the same core, while the isolation is worsened as the number of cores increases. Even though fetch policies regarding how to assign priorities in fetch stage are well designed to manage the shared resources in a core, it is actually the scheduling policy that makes the distributed resources available for workloads, through deciding how to send their threads to cores. On the other hand, threads consume various resources in different phases and Cycles Per Instruction Spent on Memory (CPImem) is used to express their resource demands. Consequently, aiming at better performance via scheduling according to their resource demands, we propose the Mix-scheduling to evenly mix threads across cores, so that it achieves thread diversity, i.e., CPImem diversity in every core. As a result, it is observed in our experiment that 63% improvement in overall system throughput and 27% improvement in average thread performance, when comparing the Mix-scheduling policy with the reference policy Mono-scheduling, which keeps CPImem uniformity among threads in every core on chips. Furthermore, the Mix-scheduling also makes an essential step towards shortening load latency, because it succeeds in reducing the L2 Cache Miss Rate by 6% from Mono-scheduling.

关键词： Instruction sets Benchmark testing Computer architecture resource management Message systems Processor scheduling Throughput

来源：评论

学校读者我要写书评

暂无评论

Optimizing resources in real-time scheduling for fault tolerant processors

Optimizing resources in real-time scheduling for fault toler...

引用

international Conference on parallel distributed and Grid Computing (PDGC)

作者： Radhamani Pillay Senthil Kumar Chandran Sasikumar Punnekkat Amrita Viswavidyapeetham University Coimbatore India AERB-Safety Research Institute Kalpakkam India Mälardalen Real-Tïme Research Centre Mälardalen University Vasteras Sweden

The safety critical systems used in avionics, nuclear power plants and emergency medical equipments have to meet stringent reliability and temporal demands. Such demands are met with fault tolerant mechanisms, such as hardware and software redundancy. In this paper, we consider a safety critical application, the dual redundant onboard computer (OBC) system of the Indian Satellite Launch Vehicle and propose a scheme to optimize the onboard computing resources without detracting from the system reliability requirements. The redundancy is dealt with at the task allocation level and the slack generated, is used for allocation of more computational tasks, making the scheme very attractive in terms of efficient management of resources. The scheme of task allocation combined with real-time scheduling using Rate Monotonic (RM) and Earliest Deadline First (EDF) provide more programming flexibility and efficiently utilize the system resources. The scheme when implemented gives an efficient offline task allocation for fault-free conditions and flexible fault tolerance strategy during processor failure. The proposed scheme is compared with a traditional dual scheme. The implementation is experimented with a simulation and evaluated using performance metrics to illustrate the enhanced performance capability of the approach. This scheme, extended to multiprocessors with generic features can lead to tremendous throughput in terms of performance and costs. The contributions of this work are a system level algorithm for the implementation of real-time task allocation and scheduling.

关键词： Program processors Fault tolerant systems resource management Redundancy Real time systems Circuit faults

来源：评论

学校读者我要写书评

暂无评论

A first step to the evaluation of SimGrid in the context of a real application

A first step to the evaluation of SimGrid in the context of ...

引用

IEEE international Symposium on parallel and distributed Processing workshops and Phd Forum (IPDPSW)

作者： Abdou Guermouche Hélène Renard LaBRI University of Bordeaux 1 Bordeaux France I3S and University Nice/Sophia-Antipolis Sophia-Antipolis France

ISBN: (纸本)9781424465330

Simulation is a ¿simple¿ method to experimentally evaluate the behavior of algorithms designed for parallel and distributed platforms. Moreover, the reliability of the evaluation strongly depends on the models used inside the simulator. This paper is devoted to the study and the evaluation of the behavior of the SimGrid simulator through a comparison between a simulated and a real execution of the same target application (i.e. heat propagation). Our target platforms are heterogeneous and their characteristics may dynamically vary during the execution. The obtained results (on a set of various platforms) show that the behavior observed when using the simulated platform is very close to the one obtained on the real one.

关键词： Computational modeling distributed computing Application software Peer to peer computing Algorithm design and analysis Large-scale systems distributed algorithms resource management Processor scheduling Software algorithms

来源：评论

学校读者我要写书评

暂无评论

Game-theoretic, Market and Meta-Heuristics Approaches for Modelling scheduling and resource Allocation in Grid systems

Game-theoretic, Market and Meta-Heuristics Approaches for Mo...

引用

international Conference on P2P, parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Fats Xhafa Joanna Kolodziej Department of Computer Science and Information System Birkbeck University of London London UK Department of Mathematics and Computer Science University of Bielsko-Biała Bielsko-Biala Poland

Task scheduling and resource allocation are the crucial issues in any large scale distributed system, such as Computational Grids (CGs). However, traditional computational models and resolution methods cannot effectively tackle the complex nature of Grid, where the resources and users belong to many administrative domains with their own access policies, users' privileges, etc. Recently, researchers are investigating the use of game theoretic approaches for modelling task and resource allocation problems in CGs. In this paper, we present a compact survey of the most relevant research proposals in the literature to use game-based models for the resource allocation problems and their resolution using metaheuristic methods. We emphasize the need of the translation of the traditional economical models into the game scenarios and the use of metaheuristic schedulers for solving such games in order to address the new complex scheduling and allocation criterions. We study the case of asymmetric Stackelberg game used for modelling the Grid users' behavior, where the security and reliability criterions are aggregated and defined as the users' costs functions. The obtained results show the efficiency of the hybridization of heuristic-based approaches with game models, which enables to include additional requirements and features into the computational models and tackle more effectively the resolution of the applied schedulers.

关键词： Games Computational modeling Biological system modeling resource management Processor scheduling scheduling Security

来源：评论

学校读者我要写书评

暂无评论

An Economy Based Storage Grid Federation with a Decentralized scheduling Technique

An Economy Based Storage Grid Federation with a Decentralize...

引用

international Conference on Computational Science and its Applications (ICCSA)

作者： Ravin Ahuja Asok De G. Gabrani Delhi College of Engineering New Delhi India Tecpro Systems Limited Gurgaon India

With the evolution of Grid technology, it has become possible to connect resources (service providers or consumers) topologically spread apart falling in different administrative domains. The users or applications submitting multiple storage requests are managed through scheduling arrangements in a centralized manner. The distribution and allocation of the storage requests therefore occurs oblivious of the efficiency and engagements of the underlying resources. The authors propose a model of Storage Grid Federation motivated by concept of Grid Federation constituted of computational resources formulated through peer level coupling. The algorithm is designed for the resource management with a decentralized approach incorporating policies capable of resource monitoring through entities like Storage Federation Agents so as to yield to higher autonomy. The preferences of the consumers are well accessed such as budget, negotiation policies, a specific need of storage and protocol of the organization they belong to. The design includes penal clause and discounts in accordance to a service level agreement while offering Storage Grid services at specified time in future. The goal is achieved through creating number of Storage Federation Agents that are competent to cater to local resource Service Provider policies. The SFA resource managers are competent to ensure load balancing before distribution of storage requests. The proposed algorithm allows negotiation with SFAs in addition to the local and remote SFAs falling in different domains and hence improving upon its previous federation model based on computational resources only.

关键词： resource management Processor scheduling Grid computing Concurrent computing distributed computing Educational institutions parallel processing High performance computing Quality of service Communication networks

来源：评论

学校读者我要写书评

暂无评论

Towards decentralized grid agent models for continuous resource discovery of interoperable grid Virtual Organisations

Towards decentralized grid agent models for continuous resou...

引用

international Conference on Digital Information management (ICDIM)

作者： Stelios Sotiriadis Nik Bessis Ye Huang Paul Sant Carsten Maple Department of Computer Science and Technology University of Bedfordshire UK Department of Informatics University of Freiburg Switzerland

Grid technology enables resource sharing among a massive number of dynamic and geographically distributed resources. The significance of such environments is based on the aptitude of grid members to look across multiple grids for resource discovery and allocation. parallel to grid, agents are autonomous problem solvers capable of self-directed actions in flexible environments. As grid systems require self-sufficiency, agents may be the means by which to achieve a robust autonomy infrastructure. In this direction we propose a resource discovery method of interoperable grid agents which travel within Virtual Organizations (VOs) and by capturing resource information regarding their action domain; they update the internal data of each grid member. Moreover we propose that resource discovery is a systematic and continually updating process that occurs within a VO and allows information exchange to happen. This exchange takes place between various community members at a pre-defined interval, aiming to distribute internal knowledge about the domain.

关键词： Broadcasting Autonomous agents Containers Web services Dynamic scheduling Communities Mobile agents

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共95页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：