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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

检索条件"任意字段=18th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 660 条记录，以下是181-190 订阅

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

详细简洁

排序：

Pipelined parallel LZSS for Streaming Data Compression on GPGPUs

Pipelined Parallel LZSS for Streaming Data Compression on GP...

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Ozsoy, Adnan Swany, Martin Chauhan, Arun Indiana Univ Sch Informat & Comp Bloomington IN 47405 USA

ISBN: (纸本)9781467345651;9780769549033

In this paper, we present an algorithm and provide design improvements needed to port the serial Lempel-Ziv-Storer-Szymanski (LZSS), lossless data compression algorithm, to a parallelized version suitable for general purpose graphic processor units (GPGPU), specifically for NVIDIA's CUDA Framework. the two main stages of the algorithm, substring matching and encoding, are studied in detail to fit into the GPU architecture. We conducted detailed analysis of our performance results and compared them to serial and parallel CPU implementations of LZSS algorithm. We also benchmarked our algorithm in comparison with well known, widely used programs;GZIP and ZLIB. We achieved up to 34x better throughput than the serial CPU implementation of LZSS algorithm and up to 2.21x better than the parallelized version.

关键词： Lossless data compression LZSS GPU CUDA

来源：评论

学校读者我要写书评

暂无评论

Spanning trees for distributed search in P2P systems

Spanning trees for distributed search in P2P systems

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Kaushik, Neena R. Figueira, Silvia M. Department of Computer Engineering Santa Clara University Santa Clara CA 95053-0566 United States

Searching for data location in P2P systems is a message-intensive task. Basically, a query needs to reach all the nodes in order to find the locations of a specified data. this search involves a broadcast, and an inappropriate broadcast strategy may not only lead to inefficient data sharing, but also directly affect the scalability of the P2P system. We propose the utilization of an ad-hoc spanning tree for distributed search in P2P systems. this spanning tree is built as an overlay network. We define algorithms to maintain the ad-hoc spanning tree, and we compare the search time obtained with the ad-hoc spanning tree with the time obtained with other structures used for broadcasting in parallel and distributed systems. this comparison is done with an MPI emulation.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization of a parallel, Two Stage Stochastic Linear Program

Performance Optimization of a Parallel, Two Stage Stochastic...

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Langer, Akhil Venkataraman, Ramprasad Palekar, Udatta Kale, Laxmikant V. Baker, Steven Univ Illinois Dept Comp Sci 1304 W Springfield Ave Urbana IL 61801 USA Univ Illinois Coll Business Urbana IL 61801 USA Mitre Corp Mclean VA USA

ISBN: (纸本)9781467345651;9780769549033

Stochastic optimization is used in several high impact contexts to provide optimal solutions in the face of uncertainties. this paper explores the parallelization of two-stage stochastic resource allocation problems that seek an optimal solution in the first stage, while accounting for sudden changes in resource requirements by evaluating multiple possible scenarios in the second stage. Unlike typical scientific computing algorithms, linear programs (which are the individual grains of computation in our parallel design) have unpredictable and long execution times. this confounds both a priori load distribution as well as persistence-based dynamic load balancing techniques. We present a master-worker decomposition coupled with a pull-based work assignment scheme for load balance. We discuss some of the challenges encountered in optimizing both the master and the worker portions of the computations, and techniques to address them. Of note are cut retirement schemes for balancing memory requirements with duplicated worker computation, and scenario clustering for accelerating the evaluation of similar scenarios. We base our work in the context of a real application: the optimization of US military aircraft allocation to various cargo and personnel movement missions in the face of uncertain demands. We demonstrate scaling up to 122 cores of an intel (R) 64 cluster;even for very small, but representative datasets. Our decision to eschew problem-specific decompositions has resulted in a parallel infrastructure that should be easily adapted to other similar problems. Similarly, we believe the techniques developed in this paper will be generally applicable to other contexts that require quick solutions to stochastic optimization problems.

关键词： stochastic optimization parallel computing large scale optimization airfleet management

来源：评论

学校读者我要写书评

暂无评论

parallel synchronization issues in simulating artificial life

Parallel synchronization issues in simulating artificial lif...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： James, H.A. Scogings, C.J. Hawick, K.A. Inst. of Info. and Math. Science Massey University Albany North Shore 102-904 Auckland New Zealand

Update methods are an important aspect of the burgeoning Artificial Life research area. Artificial Life models, like the Predator-Prey model, are able to operate quite efficiently when implemented in a sequential manner only while population numbers are low to moderate. We find that for large populations sequential implementations are too slow to extract meaningful measurement statistics. In this paper we discuss the parallelisation of sequential update methods for use in Artificial Life systems. We also discuss the ramifications that parallel update algorithms introduce to data dependencies and also the meaning of correctness in parallel models.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Generalized optional locking in distributed systems

Generalized optional locking in distributed systems

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Schöbel-theuer, thomas Universität Stuttgart Germany

We present optional locking as a method for significantly speeding up distributed locks, and we generalize it to multiple lock types obeying a conflict relation. the generalized version can simulate the message passing paradigm on top of distributed Shared Memory (DSM) with no more messages than explicit message passing would need. thus we argue that message passing can be viewed as a true special case of optional locking. As a consequence, the attractiveness of DSM programming models should increase significantly due to well-recognized advantages such as simplicity and reduced software engineering cost;mixtures of both message passing and shared data access patterns can be treated uniformly. Measurements and simulations based on database benchmarks indicate a substantial performance improvement of optional locking over conventional locking even in presence of multiple lock types.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Measuring causal propagation of overhead of inefficiencies in parallel applications

Measuring causal propagation of overhead of inefficiencies i...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Jafri, Hassan M. National Center for Supercomputing Applications University of Illinois Urbana-Champaign United States

ISBN: (纸本)9780889867048

parallel applications are notorious for their intractability to performance debugging. Automatic performance analysis techniques, such as those used by Kojak and KappaPI, are promising in alleviating the difficulty of discovering performance inefficiencies in parallel applications. However, as we show in this paper, the results produced by these tool can be potentially misleading and sometimes, outright incorrect. the reason is that the overhead due to performance inefficiencies originating at a certain point in the program can causally propagate and manifest itself at other points. Current techniques perform a flat analysis, i.e., they do not account for causal propagation. In this paper, we present a method of causal analysis that current analysis techniques can be retrofitted with to account for causal propagation of overhead to arrive at a more accurate description of performance bottlenecks. We also show various advantages rendered by this technique to improving the effectiveness of automatic performance analysis. In this paper, we only tackle overhead related to communication operations in MPI parallel application. In general, however, our technique can be used for non-communication related overhead for any parallel programming paradigm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Techniques to reduce synchronization in distributed parallel logic simulation

Techniques to reduce synchronization in distributed parallel...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Chang, Kai-Hui Tu, Wei-Ting Wang, Han-Wei Yeh, Yi-Jong Kuo, Sy-Yen Avery Design Systems Inc. Andover MA 01810 United States Grad. Inst. of Electron. Engineering Dept. of Electrical Engineering National Taiwan Univ No.1 Sec. 4 Roosevelt Road Taipei Taiwan

As the complexity of chip designs increase, simulation time also increases. Unit and variable delay simulation takes the most simulation time in IC design process;however, parallel processing performs inefficiently due to large amount of synchronization. In this paper, techniques to reduce the number of synchronization points in synchronous designs are proposed, and a partitioner to partition designs along flip-flop boundaries is also proposed so that these techniques can be employed on real designs.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of concurrent distributed systems based on object-oriented approach

Automatic generation of concurrent distributed systems based...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Galicia, Jorge Cortés García, Felipe R. Menchaca Ctro. de Invest. en Computation Inst. Politécnico Nacional U. Profesional Adolfo Lopez Mateos Esq. Miguel Othon de Mendizabal Zacatenco Ciudad de México Mexico

this paper presents an evolutionary prototyping methodology oriented to the model, design and implementation of concurrent distributed systems. this methodology use two several stages: a modeling language of concurrent distributed systems LeMSiDiC (a graphical modeled language who provides UML-like structuring capabilities and a precise syntax and semantic for automatic source code generation for these types of systems);a source code generator GeCSiDiC (a code generator able to construct the objects associated to the model specified with LeMSiDiC using the object-oriented paradigm). the methodology allows to interrelate with one architecture oriented to concurrent distributed systems management or to interrelate with concurrent distributed systems without a specialized support.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A Non-Intrusive Read-Copy-Update for UTS

A Non-Intrusive Read-Copy-Update for UTS

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Podzimek, Andrej Decky, Martin Bulej, Lubomir Tuma, Petr Charles Univ Prague Fac Math & Phys Dept Distributed Dependable Syst Prague Czech Republic

ISBN: (纸本)9781467345651

Read-Copy-Update (RCU) is a mechanism designed to increase the level of concurrency in readers-writer synchronization scenarios, vastly improving scalability of software running on multiprocessor machines. Most existing RCU variants have been developed for and studied within the Linux kernel. Due to strong dependency on the Linux internals, they cannot be easily transferred to other operating system kernels. this paper presents a novel non-intrusive variant of the RCU mechanism (AP-RCU), which depends only on basic kernel-level concepts while maintaining the scalability benefits. We have implemented AP-RCU in the Solaris kernel (UTS) and experimentally confirmed the expected benefits over traditional forms of synchronization, comparable with previous RCU implementations.

关键词： RCU read-copy-update UTS Solaris SMP synchronization scalability

来源：评论

学校读者我要写书评

暂无评论

A high-performance parallel Scheduling Architecture for WiMAX base-stations

A high-performance parallel Scheduling Architecture for WiMA...

引用

20th iasted international conference on parallel and distributed computing and systems, PDCS 2008

作者： Singh, Gagandeep Prabhu, Salil Mir, Nader F. Electrical Engineering Dept. San Jose State University CA 95192 United States

ISBN: (纸本)9780889867741

In this paper, we provide an "Improved Channel Aware QoS Scheduling Architecture for WiMAX Base Stations". In this scheme, we provide intelligence to the classifier by having feedback from the compensation block. We capitalize on the design of WiMAX, which differentiates connections with separate connection IDs and classifies traffic, based on a class-based approach. We propose a design in which the Classifier, in order to provide excellent QoS, admits frames with only those CIDs that can be serviced without any significant delay to the real time voice and video applications, thus improving the overall QoS. In other words, it rejects a packet having a CID which is experiencing bad channel quality and allows unmarked CIDs to utilize the channel at its maximum efficiency.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：