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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

249 篇 期刊文献
129 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

356 篇 工学
- 222 篇 计算机科学与技术...
- 166 篇 电气工程
- 126 篇 信息与通信工程
- 50 篇 机械工程
- 44 篇 控制科学与工程
- 31 篇 软件工程
- 16 篇 电子科学与技术（可...
- 12 篇 交通运输工程
- 7 篇 仪器科学与技术
- 5 篇 测绘科学与技术
- 2 篇 力学（可授工学、理...
- 1 篇 石油与天然气工程
- 1 篇 网络空间安全
62 篇 管理学
- 62 篇 管理科学与工程(可...
- 19 篇 工商管理
- 1 篇 图书情报与档案管...
20 篇 理学
- 9 篇 数学
- 5 篇 物理学
- 4 篇 生物学
- 3 篇 化学
- 1 篇 地球物理学
- 1 篇 系统科学
19 篇 经济学
- 19 篇 应用经济学
1 篇 医学
- 1 篇 临床医学

主题

379 篇 distributed sche...
20 篇 scheduling
12 篇 artificial bee c...
12 篇 multi-agent syst...
10 篇 job shop schedul...
9 篇 resource managem...
9 篇 optimization
9 篇 ieee 802.16
9 篇 preventive maint...
9 篇 wireless network...
8 篇 load balancing
8 篇 resource allocat...
8 篇 qos
7 篇 interference
7 篇 fairness
7 篇 makespan
7 篇 flowshop
7 篇 supply chain
6 篇 big data
6 篇 grid computing

机构

15 篇 wuhan univ techn...
7 篇 tsinghua univ de...
6 篇 univ hong kong d...
5 篇 huazhong univ sc...
4 篇 shanghai univ sc...
4 篇 liaocheng univ s...
4 篇 city univ hong k...
3 篇 tata inst fundam...
3 篇 shandong normal ...
3 篇 univ toulouse in...
3 篇 qualcomm inc san...
3 篇 univ hong kong d...
3 篇 lanzhou univ tec...
3 篇 shanghai univ sc...
3 篇 univ sci & techn...
2 篇 ensta paristech ...
2 篇 univ toronto on
2 篇 yonsei univ dept...
2 篇 ohio state univ ...
2 篇 indian inst sci ...

作者

17 篇 lei deming
10 篇 wang ling
7 篇 cai jingcao
6 篇 pan quan-ke
6 篇 gao liang
4 篇 wang lei
4 篇 swami ananthram
4 篇 gurewitz omer
4 篇 archimede bernar...
4 篇 theoleyre fabric...
4 篇 zhao fuqing
4 篇 wang jingjing
4 篇 zhou liang
4 篇 cohen asaf
4 篇 letouzey agnes
4 篇 liang l
4 篇 chan felix t. s.
3 篇 sang hong-yan
3 篇 pan zixiao
3 篇 han yu-yan

语言

341 篇 英文
31 篇 其他
6 篇 中文
2 篇 德文
2 篇 法文
1 篇 日文

检索条件"主题词=distributed scheduling"

共 379 条记录，以下是71-80 订阅

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

详细简洁

排序：

Adaptive Topology-Transparent distributed scheduling in Wireless Networks

Adaptive Topology-Transparent Distributed Scheduling in Wire...

引用

2010 IEEE International Conference on Communications

作者： Sun, Qiong Li, Victor O. K. Leung, Ka-Cheong Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424464043

Transmission scheduling is a key design problem in wireless multi-hop networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time division multiple access (TDMA) frame length. Most of the scheduling algorithms are topology-dependent. They are generally graph-based and depend on the exact network topology information. Thus, they cannot adapt well to the dynamic wireless environment. In contrast, topology-transparent TDMA scheduling algorithms do not need detailed topology information. However, these algorithms offer very low minimum throughput. The objective of this work is to propose an adaptive topology-transparent scheduling algorithm to offer better throughput performance. With our algorithm, each node finds a transmission schedule so as to reduce the transmission conflicts and adapt better to the changing network environment. The simulation results show that the performance of our algorithm is better than the existing topology-transparent algorithms.

关键词： Adaptive algorithms distributed scheduling TDMA topology-transparent wireless networks

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of distributed scheduling for Downlink Coherent Joint Transmission 82

Performance Evaluation of Distributed Scheduling for Downlin...

引用

IEEE 82nd Vehicular Technology Conference (VTC Fall)

作者： Sun, Huan Yang, Tao Alcatel Lucent Shanghai Bell Res & Innovat Ctr Shanghai 201206 Peoples R China

ISBN: (纸本)9781479980918

Coordinated multi-point transmission (CoMP) is regarded as one of the key LTE-A technologies. Various CoMP schemes have been extensively investigated, and coherent joint transmission scheme (CJT) has been demonstrated to extract the largest CoMP gains in both cell average performance and cell edge performance. In CJT scheme, multiple coordinated cells constitute a supper cell adopting centralized multi-user scheduling and resource allocation. However, with CoMP cluster size increasing, traditional CJT scheme faces multiple severe challenges, such as the unacceptable computational complexity and more strict latency requirements. In this paper, distributed scheduling scheme is proposed for downlink CJT to alleviate the computational complexity and other system strict requirements. The complexity of the proposed scheme is analyzed. Comprehensive performance evaluations of the proposed scheme are performed by system level simulations in various transmission scenarios. Taking the performance of single cell as the baseline, the proposed scheme can achieve over 35% cell average gain and over 32% cell edge gain with low complexity.

关键词： CoMP CJT distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

A distributed scheduling algorithm for heterogeneous cache-enabled small cell networks using ADMM 82

A distributed scheduling algorithm for heterogeneous cache-e...

引用

IEEE 82nd Vehicular Technology Conference (VTC Fall)

作者： Zhang, Zhilong Liu, Danpu Beijing Univ Posts & Telecommun Beijing Key Lab Network Syst Architecture & Conve Beijing 100876 Peoples R China

ISBN: (纸本)9781479980918

We consider designing a distributed scheduling algorithm for multi-homing users in heterogeneous cacheenabled small cell networks. The aim is to minimize the total operation cost on condition that all users' QoS requirements are satisfied. The proposed algorithm is based on alternating direction method of multipliers (ADMM) and can be carried out in each small cell base station (SCBS) independently. Simulation results show that the operation cost converges to the global optimum after a few iterations and the proposed algorithm outperforms a conventional distributed method largely.

关键词： distributed scheduling cache-enabled small cell multi-homing ADMM

来源：评论

学校读者我要写书评

暂无评论

Performance driven distributed scheduling of parallel hybrid computations

Performance driven distributed scheduling of parallel hybrid...

引用

20th International Symposium on Algorithms and Computations (ISAAC 2009)

作者： Narang, Ankur Shyamasundar, Rudrapatna K. IBM Res India Inst Area New Delhi 110070 India Tata Inst Fundamental Res Bombay 400005 Maharashtra India

Exascale computing is fast becoming a mainstream research area. In order to realize exascale performance, it is necessary to have efficient scheduling of large parallel computations with scalable performance on a large number of cores/processors. The scheduler needs to execute in a pure distributed and online fashion, should follow affinity inherent in the computation and must have low time and message complexity. Further, it should also avoid physical deadlocks due to bounded resources including space/memory per core. Simultaneous consideration of these factors makes affinity driven distributed scheduling particularly challenging. We attempt to address this challenge for hybrid parallel computations which contain tasks that have pre-specified affinity to a place and also tasks that can be mapped to any place in the system. Specifically, we address two scheduling problems of the type P(m)[M(j), prec]C(max). This paper presents online distributed scheduling algorithms for hybrid parallel computations assuming both unconstrained and bounded space per place. We also present the time and message complexity for distributed scheduling of hybrid computations. To the best of our knowledge, this is the first time that distributed scheduling algorithms for hybrid parallel computations have been presented and analyzed for time and message bounds under both unconstrained space and bounded space. (C) 2011 Elsevier B.V. All rights reserved.

关键词： distributed scheduling Multithreaded computation Asymptotic complexity Deadlock free scheduling Work stealing Online algorithm

来源：评论

学校读者我要写书评

暂无评论

DELAY-ORIENTED distributed scheduling USING GRAPH NEURAL NETWORKS 47

DELAY-ORIENTED DISTRIBUTED SCHEDULING USING GRAPH NEURAL NET...

引用

47th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Zhao, Zhongyuan Verma, Gunjan Swami, Ananthram Segarra, Santiago Rice Univ Houston TX 77251 USA US Armys DEVCOM Army Res Lab Adelphi MD USA

ISBN: (纸本)9781665405409

In wireless multi-hop networks, delay is an important metric for many applications. However, the max-weight scheduling algorithms in the literature typically focus on instantaneous optimality, in which the schedule is selected by solving a maximum weighted independent set (MWIS) problem on the interference graph at each time slot. These myopic policies perform poorly in delay-oriented scheduling, in which the dependency between the current backlogs of the network and the schedule of the previous time slot needs to be considered. To address this issue, we propose a delay-oriented distributed scheduler based on graph convolutional networks (GCNs). In a nutshell, a trainable GCN module generates node embeddings that capture the network topology as well as multi-step lookahead backlogs, before calling a distributed greedy MWIS solver. In small- to medium-sized wireless networks with heterogeneous transmit power, where a few central links have many interfering neighbors, our proposed distributed scheduler can outperform the myopic schedulers based on greedy and instantaneously optimal MWIS solvers, with good generalizability across graph models and minimal increase in communication complexity.

关键词： Maximum weighted independent set graph neural networks distributed scheduling latency

来源：评论

学校读者我要写书评

暂无评论

DALEOS: distributed scheduling for earth observation Data Analytics in LEO Satellites

DALEOS: Distributed scheduling for earth observation Data An...

引用

IEEE International Conference on Pervasive Computing and Communications (PerCom)

作者： Biswas, Swagata Paul, Himadri Sekhar TCS Res Mumbai India

ISBN: (纸本)9798350304367;9798350304374

Orbital edge computing (OEC) is gaining interest in multiple application domains due to its potential to mitigate the limitations of traditional bent pipe architecture through in-orbit processing. In one study it was observed that on-board computing facility is idle for about 80% of its mission period. Although processing capability of a single satellite is constrained, but the collective computing power of a constellation is substantial and potentially be exploited for effective distributed in-orbit data processing. In this paper, we propose a distributed scheduling algorithm, DALEOS, for small satellite clusters targeted to meet real-time constraints of data analysis tasks. Our approach efficiently utilizes the constrained resources through workflow partitioning and task distribution. We validated our proposed algorithm for a set of randomly generated task workflow and also on a practical cloud detection use case, in simulation system using satellite tracks generated from datasets downloaded from Celestrak and PlanetLab. The results depict that through efficient utilization of the resources available, the overall latency in task execution can be significantly improved.

关键词： orbital edge computing distributed scheduling earth observation data analytics

来源：评论

学校读者我要写书评

暂无评论

Design and Analysis of A New distributed scheduling Approach

Design and Analysis of A New Distributed Scheduling Approach

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Li, Wenzhuo Lin, Chuang Xue, Chao Tsinghua Univ Dept Comp Sci & Technol Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9781538616291

Big data analytics frameworks are developing towards larger degrees of parallelism and shorter task durations to achieve lower latency. Consequently, millions of scheduling decisions need to be made per second, which has posed a big challenge to today's centralized schedulers. Therefore, many researchers and enterprises turn to distributed scheduling approaches to avoid the throughput limitation of centralized designs. To our knowledge, Omega, Apollo and Sparrow are three famous approaches that make prior moves in distributed scheduling but they each have shortcomings and none of them try peer-to-peer architecture. We then propose a new scheduling approach called Piper that adapts peer-to-peer idea to the domain of distributed scheduling, which provides near-optimal performance. We have implemented Piper using Apache Thrift and the results show that Piper reduces job response times by over 1.5x when compared to Sparrow (we select Sparrow for comparison because it is a leading design and has been open source). In addition, trace-driven simulations have been used to evaluate Piper when scaling to large clusters, which further reveals that Piper provides better performance than Sparrow.

关键词： distributed scheduling peer-to-peer response time scalability big data

来源：评论

学校读者我要写书评

暂无评论

Topology-Transparent distributed scheduling in Multi-hop Wireless Networks

Topology-Transparent Distributed Scheduling in Multi-hop Wir...

引用

IEEE Global Telecommunications Conference (GLOBECOM 08)

作者： Sun, Qiong Li, Victor O. K. Leung, Ka-Cheong Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424423248

Transmission scheduling is a key design problem in wireless multi-hop networks and many scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length. Most of scheduling algorithms are graph-based, dependent on the exact network topology information and cannot adapt to the dynamic wireless environment. Some topology-independent TDMA scheduling algorithms have been proposed, and do not need accurate topology information. Our proposed algorithm follows a similar approach but with a different design strategy. Instead of minimizing the TDMA frame length, we maximize the minimum expected throughput, and we consider multicasting and broadcasting. The simulation result shows that the performance of our algorithm is better than the conventional TDMA and other existing algorithms in most cases.

关键词： distributed scheduling multi-hop wireless networks TDMA topology-transparent

来源：评论

学校读者我要写书评

暂无评论

Impact of Coordination Delay on distributed scheduling in LTE-A Femtocell Networks

Impact of Coordination Delay on Distributed Scheduling in LT...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Madan, Ritesh Sampath, Ashwin Bhushan, Naga Khandekar, Aamod Borran, Jaber Ji, Tingfang Qualcomm United States

ISBN: (纸本)9781424456383

We consider wireless femtocell networks where scheduling of transmissions is coordinated across multiple cells to mitigate interference and deliver fairness and quality of service (QoS). Coordination across multiple cells entails (i) exchange of (serving and interfering) channel information and traffic priority (which is a function of packet delays, average rate, queue length), and (ii) signalling of transmission powers over pilots so that neighboring cells can determine the expected SINR to pick the right modulation and coding scheme. Such an exchange entails delay in coordination, resulting in scheduling decisions being made on the basis of stale information received from other cells. In this paper, we study aspects of practical signalling and algorithm design to account for such coordination delay and study its impact. When the coordination across cells is done over a high latency backhaul, we design a hybrid signalling mechanism where minimal amount of additional over-the-air (OTA) signalling enhancement can lead to tremendous performance improvement. We numerically demonstrate the benefits of our approach via comparison to a centralized scheduler and reuse one scheme using system simulations based on 3GPP evaluation methodology.

关键词： 3G mobile communication 3GPP LTE-A Long Term Evolution SINR channel information coordination delay distributed scheduling femtocellular radio over-the-air quality of service quality of service scheduling telecommunication signalling transmission signallin

来源：评论

学校读者我要写书评

暂无评论

A study of distributed scheduling problem with machine maintenance

A study of distributed scheduling problem with machine maint...

引用

IEEE Conference on Cybernetics and Intelligent Systems

作者： Chan, Felix T. S. Chung, S. H. Chan, L. Y. Univ Hong Kong Dept Ind & Mfg Syst Engn Pokfulam Rd Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424400225

In this paper, we study the influence of machine maintenance to distributed scheduling problems. distributed scheduling is aiming to maximize the system efficiency by simultaneously solving two problems: (i) allocation of jobs to suitable factories, and (ii) determination of the corresponding production scheduling in each factory. scheduling of machine maintenance problems aim to, reduce the effect of breakdown and maximize the facility availability at minimum cost. However, in many distributed scheduling problems, machine scheduling assumes that machines are available all the time. In fact, every machine requires maintenance, and the maintenance policy directly affects the machine's availability. Consequently, it interrupts the production scheduling determined. This paper designed a hypothetical distributed scheduling model with three different problem sizes to demonstrate the significance of simultaneously solving machine maintenance problem with distributed scheduling problem. We applied Genetic Algorithm with Dominant Genes methodology to solve the model. Several optimization approaches, including separating and integrating the two problems, are tested and compared. The results show the merit of integration.

关键词： distributed scheduling maintenance genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共38页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：