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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
19 篇 期刊文献
9 册 图书

馆藏范围

1,019 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

763 篇 工学
- 735 篇 计算机科学与技术...
- 525 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 dongarra jack
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,000 篇 英文
19 篇 其他

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010"

共 1019 条记录，以下是981-990 订阅

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

详细简洁

排序：

Self-Correcting Broadcast in distributed Hash Tables

Self-Correcting Broadcast in Distributed Hash Tables

引用

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

作者： Ghodsi, Ali Alima, Luc Onana El-Ansary, Sameh Brand, Per Haridi, Seif IMIT-Royal Institute of Technology Kista Sweden Swed. Institute of Computer Science Kista Sweden

ISBN: (纸本)088986392X

We present two broadcast algorithms that can be used on top of distributed hash tables (DHTs) to perform group communication and arbitrary queries. Unlike other P2P group communication mechanisms, which either embed extra information in the DHTs or use random overlay networks, our algorithms take advantage of the structured DHT overlay networks without maintaining additional information. The proposed algorithms do not send any redundant messages. Furthermore the two algorithms ensure 100% coverage of the nodes in the system even when routing information is outdated as a result of dynamism in the network. The first algorithm performs some correction of outdated routing table entries with a low cost of correction traffic. The second algorithm exploits the nature of the broadcasts to extensively update erroneous routing information at the cost of higher correction traffic. The algorithms are validated and evaluated in our stochastic distributed-algorithms simulator.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

USFMPI: A Multi-Threaded Implementation of MPI for Linux Clusters

USFMPI: A Multi-Threaded Implementation of MPI for Linux Clu...

引用

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

作者： Caglar, Sadik G. Benson, Gregory D. Huang, Qing Chu, Cho-Wai Keck Cluster Research Group Department of Computer Science University of San Francisco

ISBN: (纸本)088986392X

USFMPI is an MPI 1.2 compliant implementation for Linux clusters of symmetric multiprocessors and switched networks. USFMPI was designed and implemented from scratch based on the MPI standard. Compared to existing open source or vendor supplied implementations, the source code for USFMPI is compact and easy to understand. Therefore, our implementation is well suited for exploring alternate designs and optimizations. Central to the design of USFMPI is the use of a separate communication thread to facilitate the overlap of computation and communication and to take advantage of multiple processors. We have implemented USFMPI on top of TCP for FastEthernet and GM for Myrinet. This paper describes the design and implementation of USFMPI and presents performance results from experiments executed on Linux cluster. We show that our implementation compares favorably to MPICH and LAM for point-to-point communication and much better for the allgather collective function. In addition, our multithreaded design allows for better overlapping of computation and communication when compared to single-threaded implementations.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A 64-way SIMD processing architecture on an FPGA

A 64-way SIMD processing architecture on an FPGA

引用

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

作者： Hoare, Raymond Tung, Shenchih Werger, Katrina Department of Electrical Engineering University of Pittsburgh 348 Benedum Hall Pittsburgh PA 15261 United States

ISBN: (纸本)088986392X

The architecture of an FPGA inherently allows for massive parallelism. Currently, FPGAs contain over one hundred thousand logic elements, over a thousand small memories banks and over five hundred 4k-bit memory banks. These architectural features make FPGAs an ideal platform for experimenting with different types of massively parallel architectures. This paper focuses on a Single-Instruction Multiple-Data (SIMD) system where each ALU will operate on its own local memory. The design and performance of a simple ALU that is used to exploit the parallelism of an Altera Stratix FPGA is presented in this paper. The performance and chip utilizations of 2, 4, 8, 16, 32 and 64 processing elements has been examined and found to still offer significant room for scalability to even larger numbers of processors. Our experimental results have found the I/O to be the bottleneck with our current design. Less than 25% of the logic was utilized for the 64 processor SIMD design.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

PUBB2: A Redesigned Object-Oriented Software Tool for Implementing parallel and distributed Branch-and-Bound Algorithms

PUBB2: A Redesigned Object-Oriented Software Tool for Implem...

引用

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

作者： Shinano, Yuji Fujie, Tetsuya Kounoike, Yuusuke Department of Computer Science Tokyo Univ. of Agric. and Technology 2-24-16 Naka-cho Koganei-shi Tokyo 184-8588 Japan Department of Management Science Kobe University of Commerce 8-2-1 Gakuen-nishimachi Nishi-ku Kobe 651-2197 Japan

ISBN: (纸本)088986392X

PUBB (parallelization Utility for Branch-and-Bound algorithms) is a software tool developed to provide a general framework for deploying sequential/parallel branch-and-bound algorithms. In this paper, PUBB was redesigned and renamed to PUBB2. Recently, sophisticated general frameworks for parallel branch-and-cut algorithms have been developed. Many of them have well defined but relatively large and complicated interfaces. The main goal of PUBB2 is to provide a small building block software tool with an extendable core, which is flexible enough to construct a variety of frameworks for parallelization of branch-and-bound algorithms. The software architecture of PUBB2 is introduced and its flexibility is demonstrated. In order to show how a framework can be built using PUBB2, an implementation of a simple parallelization algorithm for branch-and-bound is given as an example. Preliminary computational results using the constructed framework for the maximum clique problem are also presented.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A Processor Architecture for Simultaneously Processing Dataflow and Control-Flow Threads

A Processor Architecture for Simultaneously Processing Dataf...

引用

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

作者： Ito, Shinya Kurebayashi, Ryosuke Tomiyasu, Hiroshi Nishikawa, Hiroaki Inst. of Info. Sci. and Electronics University of Tsukuba Tsukuba Sci. City Ibaraki 305-8573 Japan

ISBN: (纸本)088986392X

A dataflow processor has attractive features for networking applications, such as the natural exploitation of parallelism and instruction-level parallel processing with no context switching overhead. However, a circular pipeline of a pure dataflow processor performs poorly when executing a code with little parallelism. This could lead to a bottleneck to overall performance. To tackle this problem with maintaining the advantages of pure dataflow, this paper proposes a processor architecture that simultaneously processes two orthogonal types of threads in a single pipeline. One kind, denoted "dataflow" is appropriate for the highly parallel parts;the other, "control-flow" is for the parts of the code with little parallelism. Furthermore, the architecture introduces an extended firing control unit, which resolves data hazards dynamically both in the execution of dataflow and control-flow threads. This paper examines (1) the effectiveness of the parallel processing with the dataflow thread, (2) the improved performance in a serial code by introducing the control-flow thread, and (3) the fairness of the scheduling among two kinds of threads. These results lead to the efficient execution of networking applications without interfering two kinds of threads.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Enhancing grid utilization by splitting and merging processes of a job

Enhancing grid utilization by splitting and merging processe...

引用

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

作者： Kiran, K. Sridhar, V. Applied Research Group Satyam Computer Services Ltd. #14 Langford Avenue Lalbagh Road Bangalore 560 025 India

ISBN: (纸本)088986392X

In a dynamic environment wherein multiple jobs are being processed on a grid, the load on the grid changes on a continuous basis. One of the objectives of the proposed approach is to enhance the utilization of the grid in such dynamic situations. While distributed applications are amenable for dynamic redistribution across grid nodes, we propose an application independent approach in which jobs are split and merged as the demand, for the grid resources, varies over a period of time. We use a clustering technique to identify the practically feasible parallelism in a job and this identified parallelism is exploited by defining an overlay network (called grid overlay network) to monitor grid status and job status;defining cache control logic for automatic translation of memory read/write to message send/receive pairs;defining a way for synchronizing multiple requests for accessing shared, global variables stored in a distributed memory;identifying the conditions under which jobs can be split or merged;automatic splitting and merging of a job across multiple nodes of the grid;and setting up shared variables in a cache block on an overlay node. The proposed approach aims to achieve the resource allocation strategy of providing what the grid has and not what a job wants thereby always maximally utilizing the grid resources.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points

引用

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

作者： Xiao, Bin Zhuge, Qingfeng He, Yi Shao, Zili Sha, Edwin H.-M. Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong Department of Computer Science University of Texas at Dallas Richardson TX 75083 United States

ISBN: (纸本)088986392X

Usually the covering problem requires all elements in a system to be covered. In some situations, it is very difficult to figure out a solution, or unable to cover all given elements because of resource constraints. In this paper, we study the issue of the partial covering problem. This problem is also referred to the robust k-center problem and can be applied to many fields. The partial covering problem becomes even more harder when we need to determine the subset of the group of all available elements to share resources. Several approximation algorithms are proposed to cover the most elements in this paper. For some real time systems, such as the battlefield communication system, the algorithm presented with polynomial-time complexity can be efficiently applied. The algorithm complexity analysis illustrates the improvement made by our algorithms, which are compared with other papers for the partial covering problem in the literature. The experimental results show that the performance of our algorithms is much better than other existing k-approximation algorithm for the robust k-center problem.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Meta Process model: A new distributed shared memory programming model

Meta Process model: A new distributed shared memory programm...

引用

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

作者： Midorikawa, H. Seikei University 3-3-1 Kichijojikita-machi Musashino-shi Tokyo Japan

ISBN: (纸本)088986392X

This paper proposes a new parallel programming model named Meta Process model and MpC language for its API. The Meta Process model is based on a hierarchical shared memory model and is characterized by its explicit parallelism description. On these points, this model is different from either the shared memory model (SMM) or the message passing model (MPM). Meta Process is a coined term that represents a group of cooperative processes to achieve a single application. The Meta Process model introduces shared data that can be accessed by all processes in the Meta Process and distinguishes process-local and process-shared data clearly with using scopes. Processes in a Meta Process share a single address space for shared data. Shared data are maintained by a relaxed memory consistency model. A programmer describes process interactions explicitly using shared data access and synchronizing operations, such as a barrier or a lock/unlock. So this model enables us to write a wide variety of parallel programs, not only SPMD programs like OpenMP/HPF but also irregular and asymmetric programs. The Meta Process model provides us both flexible parallelism description of the MPM and good program readability/writability of the SMM. An actual installation scheme for this model on the software DSM is also described.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A heurisic re-mapping algorithm reducing inter-level communication in SAMR applications

A heurisic re-mapping algorithm reducing inter-level communi...

引用

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

作者： Steensland, J. Ray, J. Sandia National Laboratory High Perf. Computing and Networks MS 9915 P.O. Box 969 Livermore CA 94550 United States

ISBN: (纸本)088986392X

This paper aims at decreasing execution time for large-scale structured adaptive mesh refinement (SAMR) applications by proposing a heuristic re-mapping algorithm and experimentally showing its effectiveness in reducing inter-level communication for five applications. The overall goal is a dynamically adaptive meta-partitioner capable of selecting and configuring the most appropriate partitioning strategy based on current system and application state. The meta-partitioner can significantly reduce execution times for SAMR applications. Computer simulations of physical phenomena are often based on solving partial differential equations by numerical methods. Adaptive methods are crucial to efficiently use computer resources. But even with adaptation, the simulations are computationally demanding and yield huge data sets. parallelization and efficient data partitioning are necessary. Adaptation causes the workload to change dynamically, calling for dynamic (re-) partitioning to maintain efficient resource utilization. Our algorithm reduced total communication volume with up to 30 percent. Since the complexity of the algorithm is low, this decrease was relatively inexpensive. We conclude that the algorithm could lower execution times for many large SAMR applications, and that, due to its parameterization, it would constitute a natural component of the meta-partitioner.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

DHARMA: A grid-enabled domain-specific metaware for hydrology

DHARMA: A grid-enabled domain-specific metaware for hydrolog...

引用

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

作者： Andresen, Daniel Neilsen, Mitchell Singh, Gurdip Kalita, Prasanta Department of Computing Science Kansas State University Dept. of Agricultural Engineering University of Illinois Urbana-Champaign

ISBN: (纸本)088986392X

The DHARMA domain-specific middleware system is intended to allow hydrologic field engineers to tackle water-management problems on a scale previously impossible without sophisticated computational management systems. DHARMA provides automatic data acquisition via the Internet;data fusion from online, local, and cached resources: smart caching of intermediate results;parallel process execution;automatic transformation and piping of data between different hydrologic simulation models;and interfaces with existing metacomputing systems. Our target watershed model, WEPP, is limited to very small watersheds with current computer technology. A revolutionary change in hydrologic modeling on the watershed scale is being brought about by applying various watershed models to large watersheds, such as the Lake Decatur Watershed which covers 925 square miles. Even with unlimited hardware, the current version of WEPP can not be applied directly to the Lake Decatur Watershed because WEPP is limited to a maximum of 75 hillslopes. To address this issue, we have integrated support for heterogeneous simulation models in our software;for example, we can use WEPP to model individual hillslopes and SITES to model the connecting channels (reaches) and dams structures, playing to the strengths of both models. In this paper, we discuss the evolving software architecture of DHARMA and its interaction with the cluster and Grid infrastructures. We also present experimental results showing the performance of DHARMA using Globus over three Beowulf clusters.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 93 94 95 96 97 98 99 100 101 102 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：