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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是721-730 订阅

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

详细简洁

排序：

Encapsulating networks and routing

Encapsulating networks and routing

引用

International symposium on parallel processing

作者： B. Zerrouk J.M. Blin A. Greiner Institut Blah Pascal-Laboramire MASI-CAO-VLSI Université Pierre et Marie Curie Paris France

Presents a new view of routing messages in interconnection networks based on the known compact interval labeling. the authors propose simple algorithms, encapsulating networks and routing, suitable for a large class of topologies. they define a floating rule that unifies the notions of virtual channels and multiple intervals labeling. the introduced approach is applied to some usual structures.< >

关键词： Routing Labeling Data structures Network topology Concurrent computing distributed computing Tree graphs

来源：评论

学校读者我要写书评

暂无评论

Fault location in multistage interconnection networks with global and distributed control

Fault location in multistage interconnection networks with g...

引用

International symposium on parallel processing

作者： E.G. Bernard M. Sauer J.A. Nossek Institute for Network Theory and Circuit Design TU Munich Munich Germany

A procedure is presented for locating single faults in N/spl times/N cube-type interconnection networks with global and with distributed control. Networks with distributed control are assumed to be based on comparator cells with bit-serial architecture. It is shown that fault location requires eight tests for interconnection networks with global control under a functional fault model and four sets of test vectors for interconnection networks with distributed control under the stuck-at fault model, given a specific implementation of the comparator cell. the outstanding feature of this procedure is that the input vectors are independent not only of the network size, but also of the actual fault location. thus, the fault location procedure can easily be implemented and has low time consumption.< >

关键词： Fault location Intelligent networks Multiprocessor interconnection networks distributed control Testing Circuit faults Fault tolerance Circuit synthesis Very large scale integration Network topology

来源：评论

学校读者我要写书评

暂无评论

A Discrete Data Dividing Approach for Erasure-Code-Based Storage Applications

A Discrete Data Dividing Approach for Erasure-Code-Based Sto...

引用

2014 ieee 8th International symposium on Service Oriented System Engineering

作者： Weidong Sun Yijie Wang Yongquan Fu Xiaoqiang Pei Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan P. R. China

Erasure codes are promising for improving the reliability of the storage system due to its space efficiency compared to the replication methods. Traditional erasure codes split data into equalsized data blocks and encode strips in different data blocks. this brings heavy repairing traffic when clients read parts of the data, since most strips read for repairing are not in the expected blocks. this paper proposes a novel discrete data dividing method to completely avoid this problem. the key idea is to encode strips from the same data block. We could see that for repairing failed blocks, the strips to be read are either in the same data block with corrupted strips or from the encoded strips. therefore, no data is wasted. We design and implement this data layout into a HDFS-like storage system. Experiments over a small-scale testbed shows that the proposed discrete data divided method avoids downloading data blocks that are not needed for clients during the repairing operations.

关键词： Strips Decoding Encoding distributed databases Writing Reliability Magnetic heads

来源：评论

学校读者我要写书评

暂无评论

Toward flexible control of the temporal mapping from concurrent program events to animations

Toward flexible control of the temporal mapping from concurr...

引用

International symposium on parallel processing

作者： E. Kraemer J.T. Stasko Graphics Visualization and Usability Center College of Computing Georgia Institute of Technology Atlanta GA USA

As parallel and distributed computers become more widely available and used, the already important process of understanding and debugging concurrent programs will rake on even greater importance. We believe that visualization can help in the process. We discuss heretofore unaddressed issues in the visualization of concurrent programs, and present the Animation Choreographer. the Animation Choreographer allows users to view, manipulate, and explore the set of alternate feasible orderings of the program execution under study, both through the Choreographer interface and in the context of the selected visualizations, thus providing the user with a variety of temporal perspectives on the computation.< >

关键词： Animation Visualization Concurrent computing distributed computing Debugging Computer interfaces Displays Computer graphics Usability Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Fuzzy communication for guided loop scheduling in multicomputers

Fuzzy communication for guided loop scheduling in multicompu...

引用

International symposium on parallel processing

作者： Chien-Ming Cheng Kai Hwang Advanced Computing Systems Company Los Angeles CA USA Department of EE-Systems University of Southern California Los Angeles CA USA

ISBN: (纸本)0818656026

We propose the use of guided loop scheduling and fuzzy communications to map shared-variable communications into message passing operations among multicomputers. the mapping mechanism converts scalar message passing operations into multiple broadcast or multiple multicast operations. the proposed method is evaluated by both simulation experiments and theoretical analysis. the performance results, considering both communication and computation, are reported for mapping two distributed matrix algorithms. Simulated benchmark results demonstrate improved performance and minimized execution time. the proposed method offers the potential to take advantage of the programmability of shared-memory systems and the scalability of distributed-memory systems.< >

关键词： Message passing Processor scheduling Broadcasting Scheduling algorithm Matrix converters Multicast algorithms Scalability parallel processing Complexity theory Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

parallelization of linearized applications in Fortran D

Parallelization of linearized applications in Fortran D

引用

International symposium on parallel processing

作者： L.M. Liebrock K. Kennedy Rice University USA

Fortran D extends Fortran to parallel computers via specification of the distribution of array variables across processors. When multidimensional arrays have been linearized for optimal performance on vector processors, Fortran D cannot produce the best parallelization because it is limited to one-dimensional distribution, which is less efficient due to surface-to-volume effects. We propose Fortran D extensions and compiler technology to support natural topology parallelization of such codes. Experimental results are presented to illustrate the improvement in performance of this approach over the performance of currently available methods.< >

关键词： Vector processors Topology Multidimensional systems Application software Concurrent computing distributed computing Cost function Logic arrays NASA Array signal processing

来源：评论

学校读者我要写书评

暂无评论

Latency hiding in message-passing architectures

Latency hiding in message-passing architectures

引用

International symposium on parallel processing

作者： U. Bruening W.K. Giloi W. Schroeder-Preikschat GMD Institute for Computer Architecture and Software Technology Berlin Germany

the paper demonstrates the advantages of having two processors in the node of a distributed memory architecture, one for computation and one for communication. the architecture of such a dual-processor node is discussed. To exploit fully the potential for parallel execution of computation threads and communication threads, a novel, compiler-optimized IPC mechanism allows for an unbuffered no-wait send and a prefetched receive without the danger of semantics violation. It is shown how an optimized parallel operating system can be constructed such that the application processor's involvement in communication is kept to a minimum while the utilization of both processors is maximized. the MANNA implementation results in an effective message start-up latency of only 1...4 microseconds. It is also shown how the dual-processor node is utilized to efficiently realize virtual shared memory.< >

关键词： Delay Computer architecture Operating systems Memory architecture Concurrent computing Yarn Message passing Software distributed computing parallel programming

来源：评论

学校读者我要写书评

暂无评论

TVGrid: A grid architecture to use the idle resources on a digital TV network 07

TVGrid: A grid architecture to use the idle resources on a d...

引用

7th ieee International symposium on Cluster Computing and the Grid, CCGrid 2007

作者： Batista, Carlos Eduardo Coelho Freire De Araújo, Tiago Maritan Ugulino Omaia, Derzu Dos Anjos, thiago Curvelo De Castro, Giuliano Maia Lins Brasileiro, Francisco Vilar De Souza Filho, Guido Lemos Digital Video Applications Lab. Federal University of Paraíba Distributed Systems Lab. Federal University of Campina Grande

ISBN: (纸本)0769528333

Systems such as SETI@home [8] have proven that it is possible to make good use of massive amounts of communication and computing power that would otherwise be wasted in the leaves of the Internet. In this paper we explore this idea in a different setting. We present the TVGrid architecture, which brings parallel application execution to the Digital TV domain, by using the idle communication and processing capacity of a digital TV network. In the proposed architecture, a TV station runs a scheduler that uses unused bandwidth in the digital TV broadcast channel to send tasks to digital TV receivers, which may run them using their unused capacity. Task's outputs are later sent back to the TV station through a return channel (a broadband Internet connection, for example). TV Grid architecture was developed during the studies of the Brazilian Digital TV project. © 2007 ieee.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

A hierarchical processor scheduling policy for multiprocessor systems

A hierarchical processor scheduling policy for multiprocesso...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： S. Ayachi S.P. Dandamudi Nortel Inc. Ottawa ONT Canada School of Computer Science Carleton University Ottawa ONT Canada

Processor scheduling policies can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition system processors and each partition is allocated exclusively to a job. In time-sharing policies, processors are temporally shared by jobs (e.g., in a round robin fashion). Equipartition is a dynamic space-sharing policy that has been proposed and studied extensively. Among the time-sharing policies, job-based round robin policy (RRJob) has been shown to be a very good policy. Performance analysis of these two policies suggests that Equipartition policy performs well at low to moderate system loads and is extremely sensitive to system overheads and variance in service demand of jobs. RRJob performs better when there is a high variance in service demand and at high system loads. Furthermore, these policies have been proposed for small-scale shared-memory systems and require a central run queue and/or central scheduler. the central queue/scheduler poses serious scalability problems for large-scale multiprocessor systems. We propose a new multiprocessor scheduling policy that combines the merits of space-sharing and time-sharing policies while eliminating the contention for the central queue/scheduler. the new policy, called hierarchical scheduling policy (HSP), uses a hierarchical run queue organization to take advantage of both temporal and spatial partitioning to allocate processing power amongst jobs waiting for service. We show that the HSP policy is considerably better than the purely space-sharing and purely time-sharing policies over a wide range of system parameters.

关键词： Multiprocessing systems Time sharing computer systems Processor scheduling Round robin parallel processing Performance analysis Large-scale systems Scalability Job listing service Computer science

来源：评论

学校读者我要写书评

暂无评论

the block distributed memory model for shared memory multiprocessors

The block distributed memory model for shared memory multipr...

引用

International symposium on parallel processing

作者： J. JaJa Kwan Woo Ryu Department of Electrical Engineering Institute for Advanced Computer Studies Institute for Systems Research University of Maryland College Park MD USA Departrnent of Computer Engineering Kyungpook National University South Korea Institute for Systems Research University of Maryland College Park MD USA

Introduces a computation model for developing and analyzing parallel algorithms on distributed memory machines. the model allows the design of algorithms using a single address space and does not assume any particular interconnection topology. We capture performance by incorporating a cost measure for interprocessor communication induced by remote memory accesses. the cost measure includes parameters reflecting memory latency, communication bandwidth, and spatial locality. Our model allows the initial placement of the input data and pipelined prefetching. We use our model to develop parallel algorithms for various data rearrangement problems, load balancing, sorting, FFT, and matrix multiplication. We show that most of these algorithms achieve optimal or near optimal communication complexity while simultaneously guaranteeing an optimal speed-up in computational complexity.< >

关键词： Algorithm design and analysis parallel algorithms Costs Concurrent computing distributed computing Computational modeling Topology Delay Bandwidth Prefetching

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 69 70 71 72 73 74 75 76 77 78 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：