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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

3,548 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,527 篇 英文
20 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3548 条记录，以下是1141-1150 订阅

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

详细简洁

排序：

Load balancing in the presence of random node failure and recovery 06

Load balancing in the presence of random node failure and re...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S. Dhakal M.M. Hayat J.E. Pezoa C.T. Abdallah J.D. Birdwell J. Chiasson Department of Electrical and Computer Engineering University of New Mexico Albuquerque NM USA Department of Electrical and Computer Engineering University of Tennessee Knoxville TN USA

ISBN: (纸本)9781424400546

In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a random fashion. A load-balancing (LB) policy for such systems should therefore be robust, in terms of workload re-allocation and effectiveness in task completion, with respect to the random absence and re-emergence of nodes as well as random delays in the transfer of workloads among nodes. In this paper two LB policies for such computing environments are presented: The first policy takes an initial LB action to preemptively counteract the consequences of random failure and recovery of nodes. The second policy compensates for the occurrence of node failure dynamically by transferring loads only at the actual failure instants. A probabilistic model, based on the concept of regenerative processes, is presented to assess the overall performance of the system under these policies. Optimal performance of both policies is evaluated using analytical, experimental and simulation-based results. The interplay between node-failure/recovery rates and the mean load-transfer delay are highlighted

关键词： Load management distributed computing Delay effects Chaos Availability Uncertainty Statistical distributions Robustness Performance analysis Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Realization of virtual networks in the DECOS integrated architecture 06

Realization of virtual networks in the DECOS integrated arch...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： R. Obermaisser P. Peti University of Technology Vienna Austria

ISBN: (纸本)9781424400546

Due to the better utilization of computational and communication resources and the improved coordination of application subsystems, designers of large distributed embedded systems (e.g., in the automotive domain) are eager to replace existing federated architectures with integrated ones. This paper focuses on the communication infrastructure of the DECOS integrated system architecture, which realizes for each application subsystem a so-called virtual network as an overlay network on top of a time-triggered communication protocol. Since all virtual networks share a single physical network, virtual networks promise massive cost savings through the reduction of physical networks and reliability improvements with respect to wiring and connectors. Furthermore, virtual networks support application subsystems that range from ultra-dependable control applications (e.g., an X-by-wire system) to non safety-critical applications such as comfort systems. For this reason, two classes (event-triggered and time-triggered) of virtual networks are realized. Encapsulation mechanisms ensure that the temporal properties of each virtual network are known a priori and independent from the communication activities in other virtual networks. In order to ensure that the virtual network abstractions hold also in the case of software faults, each application subsystem possesses a dedicated virtual network with statically assigned resources at the underlying time-triggered communication service

关键词： Computer architecture distributed computing Embedded computing Embedded system Automotive engineering Protocols Costs Telecommunication network reliability Wiring Connectors

来源：评论

学校读者我要写书评

暂无评论

The robot software communications architecture (RSCA): embedded middleware for networked service robots 06

The robot software communications architecture (RSCA): embed...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Seongsoo Hong Jaesoo Lee Hyeonsang Eom Gwangil Jeon Real-Time Operation Systems Laboratory School of Electrical Engineering and Computer Science Seoul National University of Technology Seoul South Korea Distributed Information Processing Laboratory School of Computer Science and Computer Engineering Seoul National University of Technology Seoul South Korea Department of Computer Engineering Korea Polytechnic University Siheung Gyeonggi South Korea

ISBN: (纸本)9781424400546

In this paper, we present a robot middleware technology named robot software communications architecture (RSCA) for its use in networked home service robots. The RSCA provides a standard operating environment for the robot applications together with a framework that expedites the development of such applications. The operating environment is comprised of a real-time operating system, a communication middleware, and a deployment middleware. Particularly, the deployment middleware supports the reconfiguration of component-based robot applications including installation, creation, start, stop, tear-down, and un-installation. In designing RSCA, we have adopted a middleware called SCA from the software defined radio domain and extend it since the original SCA lacks the real-time guarantees and appropriate event services. We have fully implemented RSCA and performed measurements to quantify its run-time performance. Our implementation clearly shows the viability of RSCA

关键词： Embedded software Computer architecture Middleware Service robots Application software Standards development Real time systems Operating systems Software radio Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

On efficient distributed deadlock avoidance for real-time and embedded systems 06

On efficient distributed deadlock avoidance for real-time an...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： C. Sanchez H.B. Sipma Z. Manna V. Subramonian C. Gill Computer Science Dept Stanford University Stanford CA USA Dept. of Computer Science and Engineering St. Louis Washington University Saint Louis MO USA

ISBN: (纸本)9781424400546

Thread allocation is an important problem in distributed real-time and embedded (DRE) systems. A thread allocation policy that is too liberal may cause deadlock, while a policy that is too conservative limits potential parallelism, thus wasting resources. However, achieving (globally) optimal thread utilization, while avoiding deadlock, has been proven impractical in distributed systems: it requires too much communication between components. In previous work we showed that efficient local thread allocation protocols are possible if the protocols are parameterized by global static data, in particular by an annotation of the global call graph of all tasks to be performed by the system. We proved that absence of cyclic dependencies in this annotation guarantees absence of deadlock. In this paper we present an algorithm to compute optimal annotations, that is annotations that maximize parallelism while satisfying the condition of acyclicity. Moreover, we show that the condition of acyclicity is in fact tight and exhibits a rather surprising anomaly: if a cyclic dependency is present in the annotation of the call graph and a certain minimum number of threads is provided, deadlock is reachable. Thus, in the presence of cyclic dependencies, increasing the number of threads may introduce the possibility of deadlock in an originally deadlock free system.

关键词： System recovery Real time systems Embedded system Yarn Inductors Resource management Computer science parallel processing Protocols Middleware

来源：评论

学校读者我要写书评

暂无评论

Oblivious parallel probabilistic channel utilization without control channels

Oblivious parallel probabilistic channel utilization without...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： C. Schindelhauer University of Paderborn Heinz Nixdorf Institute Paderborn

The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot use data gathering. However, if a large number of channels can be used, then parallel transmission can compensate this drawback. If the senders and receivers are not known in advance, then a control channel poses a bottleneck for communication. We present an oblivious MAC protocol, called the funnel protocol, where the channels are nearly optimally utilized in parallel. In this, senders and receivers choose for a polylogarithmic number of rounds (several sending attempts) a decreasing number of channels which are selected equiprobably. Then, we show that a previously presented approach using only one round and therefore one type of probability distribution is optimal up to some constant factor, and considerably worse than the funnel protocol. The protocol works with few resources if a sufficient number of channels is available. The funnel protocol is simple, elegant, and does not need to know the number of senders and receivers, thus being oblivious. On the bottom line we prove that small messages can be efficiently transmitted by the MAC layer in parallel without a control channel if more than one channel for communication can be used

关键词： Protocols Radio transceivers Frequency Time division multiple access Hardware Communication system control Probability distribution Sensor phenomena and characterization Central processing Unit parallel processing

来源：评论

学校读者我要写书评

暂无评论

Detecting phases in parallel applications on shared memory architectures 06

Detecting phases in parallel applications on shared memory a...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： E. Perelman M. Polito J.-Y. Bouguet J. Sampson B. Calder C. Dulong Department of Computer Science and Engineering University of California San Diego USA Intel Corporation USA

ISBN: (纸本)9781424400546

Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program's execution into phases, where samples of execution in the same phase have homogeneous behavior and similar resource requirements. In this paper, we examine applying these phase analysis algorithms and how to adapt them to parallel applications running on shared memory processors. Our approach relies on a separate representation of each thread's activity. We first focus on showing its ability to identify similar intervals of execution across threads for a single run. We then show that it is effective at identifying similar behavior of a program when the number of threads is varied between runs. This can be used by developers to examine how different phases scale across different number of threads. Finally, we examine using the phase analysis to pick simulation points to guide multithreaded simulation.

关键词： Phase detection Memory architecture Yarn Analytical models Optimizing compilers Application software Computer architecture Computer science Algorithm design and analysis Pattern analysis

来源：评论

学校读者我要写书评

暂无评论

Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation 06

Non-cooperative, semi-cooperative, and cooperative games-bas...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S.U. Khan I. Ahmad Department of Computer Science and Engineering University of Texas Arlington TX USA

ISBN: (纸本)9781424400546

In this paper we consider, compare and analyze three game theoretical grid resource allocation mechanisms. Namely, 1) the non-cooperative sealed-bid method where tasks are auctioned off to the highest bidder, 2) the semi-cooperative n-round sealed-bid method in which each site delegate its work to others if it cannot perform the work itself, and 3) the cooperative method in which all of the sites deliberate with one another to execute all the tasks as efficiently as possible. To experimentally evaluate the above mentioned techniques, we perform extensive simulation studies that effectively encapsulate the task and machine heterogeneity. The tasks are assumed to be independent and bear multiple execution time deadlines. The simulation model is built around a hierarchical grid infrastructure where machines are abstracted into larger computing centers labeled "federations", each of which are responsible for managing their own resources independently. These federations are then linked together with a primary portal to which grid tasks would be submitted. To measure the effectiveness of these game theoretical techniques, the recorded performance is evaluated against a conventional baseline method in which tasks are randomly assigned to the sites without any task execution guarantee

关键词： Resource management Game theory Grid computing Computational modeling Portals distributed computing Cost function Computer science Performance evaluation Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Integrated link/CPU voltage scaling for reducing energy consumption of parallel sparse matrix applications 06

Integrated link/CPU voltage scaling for reducing energy cons...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Seung Woo Son K. Malkowski Guilin Chen M. Kandemir P. Raghavan Department of Computer Science and Engineering Pennsylvania State University University Park PA USA

ISBN: (纸本)9781424400546

Reducing power consumption is quickly becoming a first-class optimization metric for many high-performance parallel computing platforms. One of the techniques employed by many prior proposals along this direction is voltage scaling and past research used it on different components such as networks, CPUs, and memories. In contrast to most of the existent efforts on voltage scaling that target a single component (CPU, network or memory components), this paper proposes and experimentally evaluates a voltage/frequency scaling algorithm that considers CPU and communication links in a mesh network at the same time. More specifically, it scales voltages/frequencies of both CPUs in the network and the communication links among them in a coordinated fashion (instead of one after another) such that energy savings are maximized without impacting execution time. Our experiments with several tree-based sparse matrix computations reveal that the proposed integrated voltage scaling approach is very effective in practice and brings 13% and 17% energy savings over the pure CPU and pure communication link voltage scaling schemes, respectively. The results also show that our savings are consistent with the different network sizes and different sets of voltage/frequency levels

关键词： Voltage Energy consumption Sparse matrices Frequency Application software Proposals Mesh networks Computer science Power engineering and energy parallel processing

来源：评论

学校读者我要写书评

暂无评论

Using virtual grids to simplify application scheduling 06

Using virtual grids to simplify application scheduling

引用

International symposium on parallel and distributed processing (IPDPS)

作者： R. Huang H. Casanova A.A. Chien Computer Science & Engineering and Center for Networked Systems University of California San Diego USA Information and Computer Sciences Department University of Hawaii Manoa USA

ISBN: (纸本)9781424400546

Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also raise the issue of application scheduling scalability. First, even polynomial time scheduling heuristics may take a prohibitively long time to compute a schedule. Second, and perhaps more critical, it may not be possible to gather all the resource information needed by a scheduling algorithm in a scalable manner. Our application focus is scientific workflows, which can be represented as directed acyclic graphs (DAGs). Our claim is that, in future resource-rich environments, simple scheduling algorithms may be sufficient to achieve good workflow performances. We introduce a scalable scheduling approach that uses a resource abstraction called a virtual grid (VG). Our simulations of a range of typical DAG structures and resources demonstrate that a simple greedy scheduling heuristic combined with the virtual grid abstraction is as effective and more scalable than more complex heuristic DAG scheduling algorithms on large-scale platforms

关键词： Optimal scheduling Processor scheduling Scheduling algorithm Application software Large-scale systems Grid computing Polynomials distributed computing Computer science Computer networks

来源：评论

学校读者我要写书评

暂无评论

Instability in parallel job scheduling simulation: the role of workload flurries 06

Instability in parallel job scheduling simulation: the role ...

引用

International symposium on parallel and distributed processing (IPDPS)

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

ISBN: (纸本)9781424400546

The performance of computer systems depends, among other things, on the workload. This motivates the use of real workloads (as recorded in activity logs) to drive simulations of new designs. Unfortunately, real workloads may contain various anomalies that contaminate the data. A previously unrecognized type of anomaly is workload flurries: rare surges of activity with a repetitive nature, caused by a single user, that dominate the workload for a relatively short period. We find that long workloads often include at least one such event. We show that in the context of parallel job scheduling these events can have a significant effect on performance evaluation results, e.g. a very small perturbation of the simulation conditions might lead to a large and disproportional change in the outcome. This instability is due to jobs in the flurry being effected in unison, a consequence of the flurry's repetitive nature. We therefore advocate that flurries be filtered out before the workload is used, in order to achieve stable and more reliable evaluation results (analogously to the removal of outliers in statistical analysis). At the same time, we note that more research is needed on the possible effects of flurries

关键词： Computational modeling Surges Context modeling Statistical analysis Statistical distributions Processor scheduling Computer science Discrete event simulation Production systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 111 112 113 114 115 116 117 118 119 120 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：