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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

114 篇 会议
34 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

69 篇 工学
- 44 篇 计算机科学与技术...
- 32 篇 软件工程
- 16 篇 控制科学与工程
- 13 篇 电气工程
- 12 篇 信息与通信工程
- 6 篇 机械工程
- 4 篇 动力工程及工程热...
- 4 篇 电子科学与技术（可...
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 冶金工程
- 2 篇 网络空间安全
- 1 篇 力学（可授工学、理...
- 1 篇 化学工程与技术
- 1 篇 矿业工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
26 篇 理学
- 17 篇 数学
- 7 篇 系统科学
- 5 篇 化学
- 4 篇 物理学
- 4 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 大气科学
21 篇 管理学
- 13 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
4 篇 法学
- 2 篇 法学
- 2 篇 社会学
3 篇 经济学
- 3 篇 应用经济学

主题

22 篇 distributed comp...
20 篇 laboratories
13 篇 concurrent compu...
9 篇 computer network...
8 篇 scheduling algor...
7 篇 parallel process...
7 篇 application soft...
7 篇 processor schedu...
6 篇 grid computing
6 篇 resource managem...
6 篇 quality of servi...
5 篇 computer science
5 篇 fault tolerance
5 篇 real time system...
5 篇 linear programmi...
5 篇 multimedia syste...
5 篇 algorithm design...
5 篇 hardware
5 篇 delay
4 篇 intrusion detect...

机构

7 篇 department of el...
6 篇 national laborat...
6 篇 parallel and dis...
5 篇 distributed syst...
5 篇 department of el...
5 篇 ieee
5 篇 computer network...
5 篇 g2elab grenoble ...
4 篇 university of fl...
4 篇 center for paral...
4 篇 department of el...
3 篇 school of automa...
3 篇 distributed mult...
3 篇 parallel and dis...
3 篇 laboratory for p...
3 篇 department of el...
3 篇 research center ...
3 篇 distributed syst...
2 篇 beijing huairou ...
2 篇 faculty of engin...

作者

8 篇 arturo bretas
7 篇 v. chaudhary
6 篇 shu-ching chen
6 篇 fei-yue wang
6 篇 bharadwaj veerav...
6 篇 bretas arturo
5 篇 xiaodong wang
5 篇 mei-ling shyu
5 篇 shaohe lv
5 篇 garg vijay k.
4 篇 chen shu-ching
4 篇 sean meyn
4 篇 xingming zhou
4 篇 shyu mei-ling
4 篇 jun jason zhang
3 篇 dennis agnew
3 篇 weihua zhuang
3 篇 janise mcnair
3 篇 rajkumar buyya
3 篇 agnew dennis

语言

141 篇 英文
5 篇 其他
2 篇 中文

检索条件"机构=Parallel and Distributed Systems Laboratory Electrical and Computer Engineering Department"

共 148 条记录，以下是41-50 订阅

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

详细简洁

排序：

Strings: a high-performance distributed shared memory for symmetrical multiprocessor clusters 98

Strings: a high-performance distributed shared memory for sy...

引用

International Symposium on High Performance distributed Computing

作者： S. Roy V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

ISBN: (纸本)9780818685798

Introduces Strings, a high-performance distributed shared memory system designed for clusters of symmetrical multiprocessors (SMPs). The distinguishing feature of this system is the use of a fully multithreaded runtime system, written using POSIX threads. Strings also allows multiple application threads to be run on each node in a cluster. Since most modern UNIX systems can multiplex these threads on kernel-level lightweight processes, applications written using Strings can use all the processors in a SMP machine. This paper describes some of the architectural details of the system and analyzes the performance improvements with two example programs and a few benchmark programs from the SPLASH-2 suite.

关键词： Programming profession Yarn Microprocessors Workstations Sun Concurrent computing Laboratories Fuels Oceans Drugs

来源：评论

学校读者我要写书评

暂无评论

Mapping algorithms for permutation networks

Mapping algorithms for permutation networks

引用

Midwest Symposium on Circuits and systems (MWSCAS)

作者： V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

The mapping problem arises when the dependency structure of a parallel algorithm differs from the interconnection of processors in the intended parallel computer (topological variation) or, when the number of processes required by the algorithm exceeds the number of processors available in the computer (cardinality variation). The problem discussed in this paper is to identify a distributed computing environment that best optimizes the objective function for the given problem. Distinct network permutations may result in equivalent process permutation depending upon the mapping of processes onto the processors. In this paper we study the permuting properties of dynamic interconnection networks taking process mapping into consideration. A uniform group theoretic representation for interconnection networks is developed. Finally, an algorithm to evaluate the number of passes required by an interconnection network to realize a given mapping is presented.< >

关键词： Multiprocessor interconnection networks distributed computing Concurrent computing parallel algorithms Multiprocessing systems Laboratories Costs Delay effects Routing

来源：评论

学校读者我要写书评

暂无评论

Contention sensitive fault-tolerant routing algorithms for hypercubes

Contention sensitive fault-tolerant routing algorithms for h...

引用

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

作者： R. Srinivasan V. Chaudhary S.M. Mahmud Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

We present two new fault tolerant routing algorithms for hypercubes. The first algorithm requires only local knowledge of the faults whereas the second algorithm requires global knowledge. Unlike previous fault tolerant routing algorithms, our algorithms take into consideration the dynamic conditions (link contention) of the network. We have shown that checking for dynamic conditions in fault tolerant algorithms is essential. Performance evaluation by extensive simulation of our algorithms and other fault tolerant routing algorithms show that ours are better than previous algorithms by as much as 50%; and 500%; in time and space, respectively. We also observed that global information about the location of faults does not give us additional benefit. This observation is true regardless of the consideration of the dynamic conditions in the network.< >

关键词： Fault tolerance Routing Hypercubes Telecommunication traffic distributed computing Laboratories Network topology Scalability Hardware Adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Scheduling in Wireless Networks with Successive Interference Cancellation

Context-Aware Scheduling in Wireless Networks with Successiv...

引用

IEEE International Conference on Communications Workshops

作者： Shaohe Lv Weihua Zhuang Xiaodong Wang Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Department of Electrical and Computer Engineering University of Waterloo

ISBN: (纸本)9781612842325

We consider the greedy scheduling based on the physical model in wireless networks with successive interference cancellation (SIC). There are two major stages in a scheduling scheme, link selection (to decide which link is scheduled next) and time slot selection (to deciding which slot is allocated to a given link). Most available schemes take a first-fit policy in the latter and strive to achieve good performance by careful selection of link ordering with respect to interference. Due to the accumulation effect and sequential detection nature of SIC, however, it is difficult to evaluate the interference of a link. As a result, many existing scheduling schemes become less efficient. In this paper, we take a new look on the problem and focus to the time slot selection stage. We define tolerance margin to measure the saturation of a link set and present two heuristic policies: one is to schedule a link to a slot such that the resulting set of links has a maximum tolerance margin;the other is to choose a slot such that the increase of tolerance margin is minimum. Simulation results show that the performance of the proposed schemes is better than the first-fit policy and is close to the optimal solution.

关键词： Link scheduling Successive interference cancellation Physical interference model

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Quality of Service Based Scheduling Algorithm for Wide Area Large Scale Problems

An Adaptive Quality of Service Based Scheduling Algorithm fo...

引用

IEEE International Symposium on Network Computing and Applications

作者： W. Lozano W. Rivera Parallel and Distributed Computing Laboratory Electrical and Computer Engineering Department University of Puerto Rico MayagÜez Puerto Rico

This paper explores the problem of dynamically scheduling large scale applications over wide area networks and then proposes an adaptive scheduling algorithm to provide quality of service. Our adaptive algorithm takes into account unexpected events and priority fluctuations and gives high priority to jobs with low probability of failure. Experimental results show that the new approach outperforms traditional scheduling approaches in grid computing environments

关键词： Quality of service Scheduling algorithm Large-scale systems Dynamic scheduling Wide area networks Adaptive scheduling Adaptive algorithm Fluctuations Processor scheduling Grid computing

来源：评论

学校读者我要写书评

暂无评论

Using Grid Computing to Enable distributed Radar Data Retrieval and Processing

Using Grid Computing to Enable Distributed Radar Data Retrie...

引用

IEEE International Conference on parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Diego Arias Wilson Rivera Parallel and Distributed Computing Laboratory Electrical and Computer Engineering Department University of Puerto Rico MayagÜez Puerto Rico

We describe a tool that implements a set of services to manipulate and store data from a radar network in a transparent way to end users. A major requirement of this system is data availability and reliability. Consequently, we have implemented a redundancy schema based on the information dispersal algorithm (IDA). Preliminary results show that the IDA based replication provides better reliability and less storage spending than traditional replication

关键词： Grid computing Radar Information retrieval Atmosphere Earth distributed computing computer networks Concurrent computing Reliability engineering Availability

来源：评论

学校读者我要写书评

暂无评论

On simulations in MAS development deriving stochastic models from agent implementations to examine self–organizing dynamics 15

On simulations in MAS development deriving stochastic models...

引用

15th ITG/GI Symposium on Communication in distributed systems, KiVS 2007

作者： Sudeikat, Jan Renz, Wolfgang Distributed Systems and Information Systems Computer Science Department University of Hamburg Vogt–Kölln–Str. 30 Hamburg22527 Germany Multimedia Systems Laboratory Department of Information and Electrical Engineering Hamburg University of Applied Sciences Berliner Tor 7 Hamburg20099 Germany

ISBN: (纸本)9783800729807

The decomposition of a software system into a set of autonomous entities (agents) is a promising modeling approach to today’s distributed applications. Agent interplay in these sets of agents, so–called Multi–agent systems (MAS), enables the rise of complex, i. e. self–organizing and emergent system dynamics. Engineers revise agent implementations and face the challenge to comprehend, validate and finally predict the resulting system–level behaviors. In this paper we discuss the usage of simulation models to assist engineers in examining MAS dynamics. Particularly, we show how stochastic transition systems can be inferred from agent implementations. The resulting models allow engineers to explore the stochastic processes that may underly agent designs, facilitating both system design and validation as well as system optimization. We present tool support to assist model derivation from MAS implementations, following the established BDI agent architecture and exemplify its usage in a case study. © 2007 Institute of electrical and Electronics Engineers Inc. All Rights Reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Toward a reference architecture based science gateway framework with embedded e-learning support

Toward a reference architecture based science gateway framew...

引用

作者： Pierantoni, Gabriele Kiss, Tamas Bolotov, Alexander Kagialis, Dimitrios DesLauriers, James Ullah, Amjad Chen, Huankai Fee, David Chan You Dang, Hai-Van Kovacs, Jozsef Belehaki, Anna Herekakis, Themistocles Tsagouri, Ioanna Gesing, Sandra School of Computer Science and Engineering University of Westminster London United Kingdom Parallel and Distributed Systems Laboratory SZTAKI Budapest Hungary Institute of Astronomy Astrophysics Space Applications and Remote Sensing National Observatory of Athens Athens Greece Department of Computer Science and Engineering University of Notre Dame Notre DameIN United States

Science gateways have been widely utilized by a large number of user communities to simplify access to complex distributed computing infrastructures. While science gateways are still becoming increasingly popular and the number of user communities is growing, the fast and efficient creation of new science gateways and the flexibility to deploy these gateways on-demand on heterogeneous computational resources, remain a challenge. Additionally, the increase in the number of users, especially with very different backgrounds, requires intuitive embedded e-learning tools that support all stakeholders to find related learning material and to guide the learning process. This paper introduces a novel science gateway framework that addresses these challenges. The framework supports the creation, publication, selection, and deployment of cloud-based reference architectures that can be automatically instantiated and executed even by nontechnical users. The framework also incorporates a knowledge repository exchange and learning module that provides embedded e-learning support. To demonstrate the feasibility of the proposed solution, two scientific case studies are presented based on the requirements of the plasmasphere, ionosphere, and thermosphere research communities. © 2022 The Authors. Concurrency and Computation: Practice and Experience published by John Wiley & Sons Ltd.

关键词： Ionosphere

来源：评论

学校读者我要写书评

暂无评论

Constrained-learning in artificial neural networks

Constrained-learning in artificial neural networks

引用

IEEE Pacific Rim Conference on Communications, computers and Signal Processing

作者： R. Parra-Hernandez Laboratory for Parallel and Intelligent Systems-LAPIS Department of Electrical and Computer Engineering University of Victoria Canada

The capacity to generalize is the most important characteristic in neural networks. However, the generalization capacity is lost when over-fitting occurs during the neural network training process; i.e., although the error after the training process is very small, when new data is presented to the neural network the error is large. An approach aiming to improve the neural network generalization capacity is presented in this work.

关键词： Intelligent networks Artificial neural networks Neural networks Predictive models Signal processing Laboratories Intelligent systems Artificial intelligence parallel processing Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

An energy-balanced task scheduling heuristic for heterogeneous wireless sensor networks 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Lee Kee Goh Bharadwaj Veeravalli Computer Networks and Distributed Systems Laboratory Department of Electrical and Computer Engineering National University of Singapore Singapore

ISBN: (纸本)9783540898931

In this paper, we propose a static scheduling algorithm forassigning tasks with precedence constraints onto a cluster of heterogeneoussensor nodes connected by a single-hop wireless network so as tomaximize the lifetime of the sensor network. The processing element oneach sensor node is equipped with dynamic voltage scaling capability. Inour algorithm, we assign the tasks to the sensor nodes so as to minimizethe energy consumption of the tasks on each sensor node while keepingthe energy consumption as balanced as possible. We also propose an algorithmto generate a second schedule that can improve the lifetime ofthe network further when it is used together with the original *** observe up to 311% lifetime improvement in our simulations whenour algorithms are compared to the baseline case where dynamic voltagescaling is not used.

关键词： dynamic voltage scaling energy-aware scheduling heterogeneous multiprocessor scheduling power management wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共15页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：