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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

637 篇 会议
29 册 图书
24 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

321 篇 工学
- 306 篇 计算机科学与技术...
- 161 篇 软件工程
- 40 篇 信息与通信工程
- 29 篇 电气工程
- 17 篇 控制科学与工程
- 14 篇 电子科学与技术（可...
- 8 篇 力学（可授工学、理...
- 8 篇 机械工程
- 8 篇 航空宇航科学与技...
- 7 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 5 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 生物工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 交通运输工程
116 篇 理学
- 83 篇 数学
- 28 篇 物理学
- 10 篇 系统科学
- 7 篇 生物学
- 7 篇 统计学（可授理学、...
- 5 篇 化学
- 3 篇 大气科学
39 篇 管理学
- 26 篇 管理科学与工程(可...
- 16 篇 工商管理
- 14 篇 图书情报与档案管...
11 篇 医学
- 7 篇 临床医学
- 5 篇 基础医学(可授医学...
4 篇 经济学
- 4 篇 应用经济学
2 篇 教育学
1 篇 法学
1 篇 农学
1 篇 艺术学

主题

153 篇 concurrent compu...
131 篇 distributed comp...
86 篇 parallel process...
57 篇 application soft...
56 篇 computer science
52 篇 parallel algorit...
50 篇 computer network...
48 篇 computer archite...
42 篇 parallel process...
38 篇 workstations
38 篇 hardware
34 篇 computational mo...
34 篇 costs
31 篇 message passing
30 篇 high performance...
27 篇 parallel program...
26 篇 delay
24 篇 processor schedu...
22 篇 programming prof...
20 篇 bandwidth

机构

5 篇 department of co...
3 篇 polytechnic univ...
3 篇 harbin institute...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 université jean ...
2 篇 enea headquarter...
2 篇 leibniz universi...
2 篇 department of co...
2 篇 georgia inst tec...
2 篇 syracuse univ sy...
2 篇 ruhr university ...
2 篇 unicredit milan
2 篇 northwestern uni...
2 篇 mcgill universit...
2 篇 upc barcelonatec...
2 篇 warsaw universit...
2 篇 ibm canada softw...
2 篇 university of an...

作者

4 篇 a. choudhary
4 篇 yongqiang sun
3 篇 priya unnikrishn...
3 篇 babik marian
3 篇 kit barton
3 篇 hluchy ladislav
3 篇 sun yq
3 篇 tae-geun kim
3 篇 xinda lu
3 篇 choudhary a
3 篇 m. sato
2 篇 davies a.j.
2 篇 ercan mf
2 篇 ibéria medeiros
2 篇 holger fröning
2 篇 to-yat cheung
2 篇 pascal welke
2 篇 linara adilova
2 篇 schwan k
2 篇 donato malerba

语言

684 篇 英文
3 篇 中文
2 篇 其他
1 篇 西班牙文

检索条件"任意字段=Proceedings of the 1997 Conference on Advances in Parallel and Distributed Computing"

共 690 条记录，以下是491-500 订阅

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

详细简洁

排序：

Predictable network computing

Predictable network computing

引用

International conference on distributed computing Systems

作者： A. Polze M. Werner G. Fohler Software Engineering Institute CMU USA Humboldt University of Berlin Berlin Germany

Clusters of networked commercial, off the shelf (COTS) workstations are presently used for computation intensive tasks that were typically assigned to parallel computers in the past. However, it is hardly possible to predict the timing behavior of such systems or to give guarantees about execution times. We show how our SONiC (Shared Objects Net-interconnected Computer) system can control timing and partitioning of a workstation as a step towards a distributed real time system built from COTS components. SONiC provides a class based programming interface for creation of replicated shared objects of arbitrary, user defined sizes. Weak consistency protocols are employed to improve system performance. Our scheduling service ensures the requested interactive behavior of a workstation while simultaneously giving a specified number of CPU cycles to parallel tasks. Using offline scheduling methods we are able to implement real time guaranteed services on COTS workstations.

关键词： Computer networks Workstations Concurrent computing Timing distributed computing Time sharing computer systems Control systems Real time systems Protocols System performance

来源：评论

学校读者我要写书评

暂无评论

Reducing overhead in implementing fine-grain parallel data-structures of a dataflow language on off-the-shelf distributed-memory parallel computers

Reducing overhead in implementing fine-grain parallel data-s...

引用

Annual Hawaii International conference on System Sciences (HICSS)

作者： S. Kusakabe T. Nagai K. Inenaga M. Amamiya Kyushu University Japan

In order to show the feasibility of a fine-grain dataflow computation scheme, we are implementing a fine-grain dataflow language on off-the-shelf computers, using a fine-grain multithread approach. Fine-grain parallel data-structures such as I-structures provide high level abstraction to easily write programs with potentially high parallelism. The results of preliminary experiments on a distributed memory parallel machine indicate that the performance inefficiency related to fine-grain parallel data-structures in the naive implementation is mainly caused by the calculation of the local address for distributed data, and the frequent fine-grain data access using message passing. In order to reduce the addressing overhead, we introduce a two-level table addressing technique. We employ a caching mechanism and a grouping mechanism for the fine-grain data access. The preliminary performance evaluation results indicate that these techniques are effective to improve the performance.

关键词： Automatic control Runtime Message passing Concurrent computing distributed computing parallel processing parallel programming Timing Hardware parallel machines

来源：评论

学校读者我要写书评

暂无评论

2nd International conference on Computer and Communication Technologies, IC3T 2015

2nd International Conference on Computer and Communication T...

引用

2nd International conference on Computer and Communication Technologies, IC3T 2015

ISBN: (纸本)9788132225164

The proceedings contain 76 papers. The special focus in this conference is on Computer and Communication Technologies. The topics include: Medical image fusion in curvelet domain employing PCA and maximum selection rule;gigabit network intrusion detection system using extended bloom filter in reconfigurable hardware;hash-based rule mining algorithm in data-intensive homogeneous cloud environment;privacy preservation in distributed environment using RSA-CRT;segmentation of the human corpus callosum variability from t1 weighted MRI of brain;analysis of molecular single-electron transistors using silicene, graphene and germanene;identification of the plants based on leaf shape descriptors;a comparative analysis of different social network parameters derived from Facebook profiles;a fast and hardware-efficient visual cryptography scheme for images;energy-efficient modified bellman ford algorithm for grid and random network topologies;a novel approach for speaker recognition by using wavelet analysis and support vector machines;high speed network intrusion detection system using FPGA;a novel action descriptor to recognize actions from surveillance videos;protecting the augmented browser extension from mutation cross-site scripting;large-scale data management system using data de-duplication system;connectivity model for molecular communication-based nanomachines network in normal and sub-diffusive regimes;performance improvement of read operations in distributed file system through anticipated parallel processing;a novel multi-view similarity for clustering spatio-temporal data and performance evaluation of free space optical link under various weather conditions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Client location tracking in ubiquitous information service network

Client location tracking in ubiquitous information service n...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Hung-Chin Jang Yao-Nan Lien Jyh-Shyan Huang Department of Computer Science National Chengchi University Taipei Taiwan Department of Applied Mathematics National Chengchi University Taipei Taiwan

ISBN: (纸本)0818682272

The objective of this paper is to present a feasible and efficient methodology that improves client mobility management under ubiquitous information service network. We base our system on the Open Integrated Service Network Architecture and propose a hybrid infrastructure with facilities of both a centralized Network Management Center (NMC) and a distributed Home Base Node (HEN). We also have criteria for choosing a HEN with minimum cost by computing the expected registration cost and location tracking cost according to users characteristics and called frequencies. Running a simulation, results show that our methodology is able to save up to 40% of the cost comparing to that of IS-41 when the value of Call-Mobility Ratio (CMR) is in the range of (1, 100), which means either clients are called with high frequencies or are moving with low mobilities. As the value of CMR goes down to the range of (0.01, 1), which means either clients are called with low-frequencies or are moving with high mobilities we may save up to 50% cost.

关键词： Intelligent networks Costs Frequency IP networks Computer network management Transportation Mobile radio mobility management Pervasive computing Cellular phones Computer science

来源：评论

学校读者我要写书评

暂无评论

Exploiting task and data parallelism in parallel Hough and Radon transforms

Exploiting task and data parallelism in parallel Hough and R...

引用

International conference on parallel Processing (ICPP)

作者： D. Krishnaswamy P. Banerjeer Center for Reliable & High Performance Comput. Illinois Univ. Urbana IL USA

Edge detection and shape detection in digital images are very computationally intensive problems. parallel algorithms can potentially provide significant speedups while preserving the quality of the result obtained. Hough and Radon Transforms are projection-based transforms which are commonly used for edge detection and shape detection respectively. We propose in this paper various new parallel algorithms which exploit both task and data parallelism available in Hough and Radon transforms algorithms. A memory scalable aggressive task parallel algorithm is shown to be the most optimal algorithm in terms of memory scalability and performance on an IBM SP2.

关键词： Image edge detection Pixel parallel processing Shape parallel algorithms Concurrent computing distributed computing Digital images Scalability Contracts

来源：评论

学校读者我要写书评

暂无评论

9th International conference on Modeling Techniques and Tools for Computer Performance Evaluation, 1997

9th International Conference on Modeling Techniques and Tool...

引用

9th International conferences on Modeling Techniques and Tools for Computer Performance Evaluation, 1997

ISBN: (纸本)9783540631019

The proceedings contain 18 papers. The special focus in this conference is on Modeling Techniques and Tools for Computer Performance Evaluation. The topics include: A performability modeling environment tool;dependability evaluation and the optimization of performability;design and implementation of a network computing platform using JAVA;storage alternatives for large structured state spaces;an efficient disk-based tool for solving very large markov models;efficient transient overload tests for real-time systems;towards an analytical tool for performance modeling of ATM networks by decomposition;an embedded network simulator to support network protocols’ development;synchronized two-way voice simulation for internet phone performance analysis and evaluation;processes as language-oriented building blocks of stochastic petri nets;measurement tools and modeling techniques for evaluating WEB server performance;workload characterization of input/output intensive parallel applications;interval based workload characterization for distributed systems;bounding the loss rates in a multistage ATM switch;simple bounds for queues fed by markovian sources and on queue length moments in fork and join queuing networks with general service times.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel computing environments and methods

Parallel computing environments and methods

引用

International conference on parallel computing in Electrical Engineering (PARLEC)

作者： G. Fadlallah M. Lavoie L.-A. Dessaint Groupe de Recherche en Electrique de Puissance et Commande Industrielle (GREPCI) Department of electrical engineering Ecole de Technologie Superieure QUE Canada

Recent advances in high-speed networks, rapid improvements in microprocessor design, and availability of highly performing clustering software implementations enables cost-effective high-performance parallel computing on clustered low cost workstations and PCs. Such clusters are very attractive because they rely on availability of the shelf hardware and software technologies. To simplify programming in network environments and to realise component-based software architectures, many models have emerged as possible standards, namely, RPC: Remote Procedure Call, DCE: distributed computing Environment, DCOM: distributed Component Object Model, CORBA: Common Object Request Broker Architecture, PVM: parallel Virtual Machine and MPI: Message Passing Interface. The MPI approach is considered one of the most mature methods currently used in parallel programming. MPI implementations an emerging cluster interconnects are an important requirement for useful parallel processing on cost-effective computer clusters. This paper offers art overview of different parallel computing environments and models. Functionality and performance of MPI running on homogeneous and heterogeneous workstation clusters are compared. The project goals, laboratory environment, performance measurements, future work, and a conclusion are presented.

关键词： parallel processing Availability Workstations parallel programming High-speed networks Microprocessors Software performance Costs Personal communication networks Hardware

来源：评论

学校读者我要写书评

暂无评论

Seeds for a heterogeneous interconnect

Seeds for a heterogeneous interconnect

引用

2013 IEEE 37th Annual Computer Software and Applications conference, COMPSAC 2013

作者： Hackett, Adam Ajwani, Deepak Ali, Shoukat Kirkland, Steve Morrison, John P. Hamilton Institute National University of Ireland Maynooth Ireland Exascale Systems Group IBM Research Ireland Centre for Unified Computing University College Cork Ireland Industrial Mathematics and Operations Research Group Emerging Computing Technologies Bell Laboratories Ireland

ISBN: (纸本)9780769549798

Traditionally, a parallel application is partitioned, mapped and then routed on a network of compute nodes where the topology of the interconnection network is known beforehand and is homogeneous. However, such homogeneity in interconnects is rarely required or needed for several important classes of applications. Nevertheless such interconnects are designed this way, i.e., with redundant links, to accommodate the communication patterns of a wide range of applications. However, with recent advances in technology for optical circuit switches, it is now possible to construct network with much fewer links, and to make the link endpoints configurable to suit the communication pattern of a given application. While this is economical (saving both links and the power to run them), it raises the difficult problem of how to configure the network and how to reconfigure it quickly when the application's communication pattern changes. Since the space of all configurable topologies is large and determining the quality of a topology is a time-consuming process, it is not feasible to explore the entire space. One way of dealing with this limitation is to start the search from a "good" initial topology and then conduct a restricted search around it. The success of such a strategy crucially depends on the choice of the initial or seed topology. In the past, such an initial topology was computed by mimicking the communication requirements of the application. In this paper, we propose a different approach by showing that interconnect topologies such as chordal rings(circulant graphs) chosen based on metrics such as bisection width and average shortest path length can provide a better starting point. The topology obtained by searching around such an initial topology provides almost as good a performance as an application-specific initial topology, and the search time is significantly reduced. © 2013 IEEE.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

A fault tolerant protocol as an extension to a distributed mutual exclusion algorithm

A fault tolerant protocol as an extension to a distributed m...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： V. Revannaswamy P.C.P. Bhatt Greystone Software Technology Woburn MA USA Kochi University of Technology Japan

In this paper, we present an extension to Kerry Raymond's tree based distributed mutual exclusion algorithm to make it fault tolerant. The algorithm uses a spanning tree of a computer network. With N nodes in the network the number of messages exchanged per critical section entry is typically O(log N). The novelty of the algorithm lies in each node holding information only about its immediate neighbors in the spanning tree. We basically present a protocol to make the algorithm tolerant to single node/link failure and associated network partition. This protocol assumes that the graph of the underlying network is biconnected. Basically we attempt reconfiguration of the tree after isolating the failed components. With this enhancement a significant number of cases in which the algorithm would have halted due to lack of communication paths, can be effectively handled by utilizing alternative communication paths now available, thus continuing to provide the mutual exclusion service.

关键词： Fault tolerance Protocols Partitioning algorithms Tree graphs Computer networks Software algorithms Drives distributed algorithms distributed computing Protection

来源：评论

学校读者我要写书评

暂无评论

Fault recovery for distributed shared memory systems

Fault recovery for distributed shared memory systems

引用

IEEE conference on Aerospace

作者： W.R. Dieter J.E. Lumpp Department of Electrical Engineering University of Kentucky Lexington KY USA

distributed Shared Memory (DSM) offers programmers a shared memory abstraction on top of an underlying network of distributed memory machines. advances in network technology and price/performance of workstations suggest that DSM will be the dominant paradigm for future high-performance computing. However, as long running DSM applications scale to hundreds or even thousands of machines, the probability of a node or network link failing increases. Fault tolerance is typically achieved via "checkpointing" techniques that allow applications to "roll back" to a recent checkpoint rather than restarting. High-performance DSM systems using relaxed memory consistency are significantly more difficult to checkpoint than uniprocessor or message passing architectures. This paper describes previous approaches to checkpointing message passing parallel programs along with extensions to DSM systems.

关键词： Workstations Message passing Checkpointing Programming profession Large-scale systems Computer networks High performance computing Fault tolerance parallel architectures Scalability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共69页 << < 46 47 48 49 50 51 52 53 54 55 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：