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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,787 篇 会议
1,707 篇 期刊文献
4 篇 学位论文

馆藏范围

18,498 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,195 篇 工学
- 1,877 篇 电气工程
- 1,697 篇 计算机科学与技术...
- 785 篇 软件工程
- 318 篇 信息与通信工程
- 294 篇 控制科学与工程
- 260 篇 电子科学与技术（可...
- 125 篇 仪器科学与技术
- 90 篇 机械工程
- 61 篇 核科学与技术
- 36 篇 航空宇航科学与技...
- 31 篇 网络空间安全
- 26 篇 材料科学与工程（可...
- 19 篇 生物医学工程（可授...
- 16 篇 动力工程及工程热...
- 9 篇 交通运输工程
- 6 篇 光学工程
307 篇 理学
- 142 篇 物理学
- 83 篇 数学
- 57 篇 系统科学
- 15 篇 科学技术史(分学科...
- 11 篇 化学
217 篇 管理学
- 207 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 7 篇 工商管理
51 篇 文学
- 51 篇 新闻传播学
27 篇 医学
- 19 篇 临床医学
- 12 篇 特种医学
16 篇 教育学
- 16 篇 教育学
8 篇 军事学
- 8 篇 军队指挥学
7 篇 艺术学
- 7 篇 设计学（可授艺术学...
2 篇 哲学
2 篇 农学
1 篇 历史学

主题

18,498 篇 concurrent compu...
4,475 篇 parallel process...
3,204 篇 computer archite...
2,930 篇 computer science
2,886 篇 computational mo...
2,763 篇 distributed comp...
2,728 篇 application soft...
2,516 篇 hardware
2,211 篇 computer network...
1,581 篇 costs
1,426 篇 algorithm design...
1,289 篇 delay
1,210 篇 processor schedu...
1,149 篇 parallel algorit...
1,038 篇 parallel program...
1,038 篇 laboratories
862 篇 programming prof...
846 篇 high performance...
748 篇 very large scale...
740 篇 testing

机构

78 篇 ibm thomas j. wa...
53 篇 college of compu...
35 篇 school of comput...
35 篇 mathematics and ...
33 篇 department of co...
31 篇 department of co...
30 篇 department of co...
30 篇 school of comput...
29 篇 department of el...
27 篇 department of co...
26 篇 department of co...
26 篇 sandia national ...
25 篇 department of co...
25 篇 jet propulsion l...
24 篇 school of electr...
24 篇 department of co...
22 篇 school of comput...
22 篇 department of co...
22 篇 department of co...
22 篇 institute of com...

作者

37 篇 a. choudhary
34 篇 p. banerjee
32 篇 p. sadayappan
28 篇 h.j. siegel
27 篇 s. ranka
23 篇 m. tudruj
23 篇 s. horiguchi
22 篇 v. kumar
19 篇 r.m. fujimoto
18 篇 l.m. ni
17 篇 b. parhami
17 篇 v.k. prasanna
17 篇 g.c. fox
16 篇 s.k. das
16 篇 shietung peng
16 篇 i. ahmad
16 篇 l.v. kale
15 篇 g. fox
15 篇 j. flich
14 篇 b. shirazi

语言

18,091 篇 英文
387 篇 其他
20 篇 中文

检索条件"主题词=Concurrent Computing"

共 18498 条记录，以下是4961-4970 订阅

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

详细简洁

排序：

How To Share Memory In A Distributed System

How To Share Memory In A Distributed System

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： E. Upfal A. Wigderson University of Stanford Stanford CA USA University of California Berkeley CA USA

We study the power of shared-memory in models of parallel computation. We describe a novel distributed data structure that eliminates the need for shared mernory without significantly increasing the run time of the parallel computation. We also show how a complete network of processors can deterministicly simulate one PRAM step in O(log n(loglog n) 2 ) time, when both models use n processors, and ttie size of the PRAM'S shared memory is polynomial in n. (The best previously known upper bound was the trivial O(n)). We also establish that this upper bound is nearly optimal. We prove that an online simulation of T PRAM steps by a complete network of processors requires Ω(Tlog n/loglog n) time.

关键词： Phase change random access memory concurrent computing Upper bound Computational modeling Parallel machines Random access memory Data structures Distributed computing Time sharing computer systems Polynomials

来源：评论

学校读者我要写书评

暂无评论

An interconnection network that exploits locality of communication

An interconnection network that exploits locality of communi...

引用

International Conference on Distributed computing Systems

作者： K.C. Sevcik X.-N. Tan Computer Systems Research Institute University of Toronto Canada Courant Institute New York University USA

Several patterns of structure and locality of communication among software components assigned to processors are considered. In each case, a mapping between components and processors is identified so that high-volume communication paths correspond to connections supported most efficiently by the interconnection network. It is shown that locality of communication can have a profound effect on the efficiency of communication in a multicomputer. Several types of multiprocessors and multicomputers being designed for applications in artificial intelligence are likely to exhibit locality of communication of a form suitable for use by such interconnection networks.< >

关键词： Multiprocessor interconnection networks Application software concurrent computing Programming profession Program processors Binary trees Routing Artificial intelligence Large-scale systems Computer applications

来源：评论

学校读者我要写书评

暂无评论

Clustered Decoupled Software Pipelining on Commodity CMP

Clustered Decoupled Software Pipelining on Commodity CMP

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yuanming Zhang Kanemitsu Ootsu Takashi Yokota Takanobu Baba Department of Information Science Graduate School of Engineering Utsunomiya University Japan

With the prevalence of chip multiprocessor (CMP) on server and client computers, it becomes an important issue to use the multicores to speedup existing sequential programs. Decoupled software pipelining (DSWP) is a recent proposed technique that extracts non-speculative threads from sequential programs for higher performance. However, this technique is not effective on commodity CMP architecture, because the inter-thread communication and synchronization overhead often offset the benefit from the parallelization. To reduce the overhead without modification to CMP architecture, this paper presents a clustered DSWP (CDSWP) technique that is an extension to DSWP. By communicating a dependent data set instead of a single dependent data, this technique transforms sequential program into a clustered thread pipeline. The meaning of "clustered" is that some dependent data items are clustered together as a communication unit. The advantage of this technique is that it can eliminate false sharing and reduce the average cache latency, and thus the overhead is reduced greatly. According to the preliminary experiments on some commodity CMP architectures, we have achieved loop speedup ranging from 16% to 58% on some SPEC2000 benchmark programs.

关键词： Pipeline processing Yarn Computer architecture Parallel processing Hardware Data mining Software systems Information science concurrent computing Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Disconnection-resilient file system for mobile clients

Disconnection-resilient file system for mobile clients

引用

Conference on Local Computer Networks (LCN)

作者： A. Boukerche R. Al-Shaikh B. Marleau Paradise Research Laboratory SITE University of Ottawa Australia

In this paper, we propose a novel mobile distributed file system design, which provides high available and reliable storage for files and guarantees that file operations are executed in spite of concurrency and failures. The design is intended to fit mobile clients' devices (e.g., PDAs and cell phones) that have limited storage space and cannot store all data they need, yet they require to access these data at all times. We adopt a server-side caching in order to guarantee sufficient caching space to all mobile clients, and ensure the availability of files in case of clients' failures. We present our algorithm, describe its implementation, and report on its performance evaluation using a cluster of workstations. Our results indicate clearly that our algorithm exhibits a significant degree of automation and conflict-free mobile file system

关键词： File systems File servers Network servers Personal digital assistants Availability Mobile computing concurrent computing Cellular phones Clustering algorithms Computer networks

来源：评论

学校读者我要写书评

暂无评论

Modeling and simulation of a parallel operating system: processor sharing example

Modeling and simulation of a parallel operating system: proc...

引用

International Conference on High Performance computing in the Asia-Pacific Region

作者： Joon Sung Hong Tag Gon Kim Kyu Ho Park Department of Electrical Engineering Korea Advanced Institute of Science and Technology Taejon South Korea

We consider the sharing of processors in parallel computer systems. In general, the main goal of the systems, better performance, decreases processor utilization. We model and simulate a multi-tasking parallel operating system, and estimate its performance degradation and overall system throughout in the case where threads share a processor. We formalize the system by using DEVS (Discrete Event System Specification), and implement it in the DEVS simulation environment. Simulation results show that the processor sharing between threads is acceptable in the sense of TPP (throughput per processor).

关键词： Operating systems concurrent computing Throughput Computational modeling Degradation Yarn Discrete event simulation Kernel Memory management File systems

来源：评论

学校读者我要写书评

暂无评论

A new divide and conquer method for achieving high speed division in hardware

A new divide and conquer method for achieving high speed div...

引用

Asia and South Pacific Design Automation Conference

作者： M. Mohan K. Rohini A. Kumar M. Balakrishnan Dept. of Computer Science & Engg. Indian Institute of Technology New Delhi INDIA Indian Institute of Technology Delhi New Delhi Delhi IN

ISBN: (纸本)0769514413

Presents a new method of performing division in hardware and explores different ways of implementing it. This method involves computing a preliminary estimate of the quotient by splitting the dividend, performing division of each of the parts in parallel and merging them. The estimate is refined iteratively to get the final quotient. This method is significantly fast since it carries out parallel operations to compute the preliminary quotient and makes use of a fast multiplier to refine the result. It is possible to pipeline the execution of the unit yielding further increase in throughput. Speed estimates show that this method yields a much higher throughput than other fast methods, while area and latency are comparable.

关键词： Hardware Throughput concurrent computing Yield estimation Delay Parallel processing Iterative algorithms Computer science Merging Pipelines

来源：评论

学校读者我要写书评

暂无评论

A language for multiple models of computation

A language for multiple models of computation

引用

International Workshop on Hardware/Software Codesign (CODES)

作者： D. Bjorklund J. Lilius Turku Center for Computer Science Turku Finland

We introduce a new kernel language for modeling hardware/software systems, adopting multiple heterogenous models of computation. The language has formal operational semantics, and is well suited for model checking, code synthesis etc. For different blocks of code, different scheduling policies can be applied, to reflect the different interpretations of, for example, parallelism in different models of computation. The user can add his own scheduling policies, to use or explore different models of computation.

关键词： Computational modeling Hardware design languages Processor scheduling Embedded system Parallel processing concurrent computing Libraries System-level design Modems Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

A fast sort using parallelism within memory

A fast sort using parallelism within memory

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： C. Leopold Universität Würzburg Am Hubland LS Informatik I Wurzburg Germany

The author models the internal structure of memory by a tree, where nodes represent memory modules (like cache, disks), and edges represent buses between them. The modules have smaller access time, capacity, and block size the nearer they are to the root. All buses may transmit blocks of data in parallel. The author gives a deterministic sorting algorithm based on greed-sort. Its running time is shown to be optimal up to a constant factor. The bound implies the number of parallel modules necessary at each hierarchy level to overcome the I/O bottlenecks of sorting. The proposed algorithm also applies to the less general models UMH (uniform memory hierarchies) and P-UMH.< >

关键词： Sorting Parallel processing Registers Disk drives Costs concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Incremental Optimal Chain Partition of Distributed Program Traces

Efficient Incremental Optimal Chain Partition of Distributed...

引用

International Conference on Distributed computing Systems

作者： S. Ikiz V.K. Garg Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

An important problem in distributed systems is observation of global properties of distributed computations. What makes this problem difficult is that events in the computation can be concurrent, i.e. the relation between events forms a partial order, not a total order. One of the fundamental parameters of a partial order is the width, which corresponds to the maximum number of mutually incomparable elements. For example, a process-time diagram that shows this partial order decomposition in minimum number of chains can be very useful in monitoring or debugging such computations. In this paper, we present an incremental algorithm to compute the optimal chain partition. We compare our algorithm with existing chain reduction algorithms. From a practical point of view, performance evaluation shows that our approach achieves up to 90% run-time improvement over the previously known algorithms.

关键词： Distributed computing Partitioning algorithms Clocks Visualization concurrent computing Debugging Monitoring Runtime Testing Computer science

来源：评论

学校读者我要写书评

暂无评论

Computer based diagnosis using artificial neural networks

Computer based diagnosis using artificial neural networks

引用

An International Meeting on Engineering in Medicine and Biology Society,and Conference of the Biomedical Engineering Society of India

作者： R. Vijayakumar R. Mohanakumar D. Harishankar NSS College of Engineering Palakkad Kerala India Benaiger Hospital Kollam Kerala India College of Engineering Trivandrum Kerala India

We describe a package using parallel and distributed processing elements. This package called MICINE is based on the ARTi-Artificial Neural Network proposed by Carpenter and Grossberg of MIT, USA. It is quite tedious to go through and ascertain the exact disease by giving simply some symptoms. Here we have tried to design a package which will be more efficient than a well experienced Doctor. This system takes in a set of the symptoms from the patient and tries to get the best matching disease for the symptom-set. Then it gives the proper prescription for the medicines. We have implemented the package using an alternative computational paradigm which is inherently parallel and distributed. This system when converted to a fully automatic system can give treatments to any patients without the help of human beings. Thus it can reduce human errors.

关键词： Computer networks Artificial neural networks Packaging Diseases Humans Distributed processing Medical diagnostic imaging concurrent computing Distributed computing Medical treatment

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：