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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

3,548 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,527 篇 英文
20 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing"

共 3548 条记录，以下是961-970 订阅

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

详细简洁

排序：

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Shi, Xiaoqiu Han, Jinsong Liu, Yunhao Ni, Lionel M. Wenzhou University Dept. of Computer Science Wenzhou Zhejiang 325035 China Hong Kong University of Science and Technology Dept. of Computer Science and Engineering Clear Water Bay Kowloon Hong Kong

ISBN: (纸本)1424409101

In a hybrid peer-to-peer (P2P) system, flooding and DHT are both employed for content locating. The decision to use flooding or DHT largely depends on the population of desired data. Previous works either use local information only, or do not consider dynamic factors of P2P systems. In this paper, we propose a Popularity Adaptive Search method for Hybrid (PASH) P2P systems. By dynamically detecting the content popularity, PASH properly selects search methods and efficiently saves query traffic cost and response time. We comprehensively evaluate PASH through synthetic and trace-driven simulations. The results show that PASH outperforms existing approaches and it also scales well. © 2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

proceedings - 11th ieee International symposium on distributed Simulation and Real-Time Applications, DS-BT 2007

Proceedings - 11th IEEE International Symposium on Distribut...

引用

11th ieee International symposium on distributed Simulation and Real-Time Applications, DS-RT 2007

ISBN: (纸本)0769530117

The proceedings contain 36 papers. The topics discussed include: spatial awareness of digital artefacts;an extensible collision avoidance model for realistic self-driven autonomous agents;collision detection and force response in highly detailed point-based hapto-visual virtual environments;performance enhancement in MMOGs using entity types;a visibility-driven approach to managing interest in distributed simulations with dynamic load balancing;real-time task scheduling extended overloading technique for multiprocessor systems;federate migration in a service oriented HLA RTI;distributed virtual reality in education;a grammar-based Web service enabling multi-domain distributed interoperation of command/control and simulation systems;a lightweight heuristic-based mechanism for collecting committed consistent global states in optimistic simulation;and efficient analysis of simultaneous events in distributed simulation.

关键词： Autonomous agents

来源：评论

学校读者我要写书评

暂无评论

Almost peer-to-peer clock synchronization

Almost peer-to-peer clock synchronization

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Sobeih, Ahmed Hack, Michel Liu, Zhen Zhang, Li University of Illinois at Urbana-Champaign Department of Computer Science Urbana IL 61801 United States IBM T.J. Watson Research Center 19 Skyline Drive Hawthorne NY 10532 United States

ISBN: (纸本)1424409101

In this paper, an almost peer-to-peer (AP2P) clock synchronization protocol is proposed. AP2P is almost peer-to-peer in the sense that it provides the desirable features of a purely hierarchical (client/server) clock synchronization protocol while avoiding the undesirable consequences of a purely peer-to-peer one. In AP2P, a unique node is elected as a leader in a distributed manner. Each non-leader node adjusts its clock rate based on message exchanges with its neighbors, taking into consideration that neighbors that are closer to the leader have more effect on the adjustment than the neighbors that are further away from the leader. We compare the performance of AP2P with that of the Server Time Protocol (STP), which is a purely hierarchical clock synchronization protocol. Simulation results, which have been conducted on several network topologies, have shown that AP2P can provide a clock synchronization accuracy that is indistinguishable from that of STP Furthermore, AP2P is more fault-tolerant because it can recover from certain types of failures that STP cannot recover from. © 2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Reifying control of multi-owned network resources

Reifying control of multi-owned network resources

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Jamali, Nadeem Liu, Chen University of Saskatchewan Dept. of Computer Science 176 Thorv. Bldg. Saskatoon Sask. Canada University of Alberta Dept. of Computing Science 2-21 Athab. Hall Edmonton Alta. Canada

ISBN: (纸本)1424409101

Communication delay is a key source of uncertainty in distributed systems. Existing approaches to reduce this uncertainty focus on maintaining sufficient surplus bandwidth;applications, on their part, are designed in ways to tolerate certain degree of uncertainty in communication delays. This leads to contention between the goals of optimal utilization and acceptable delays. We argue that the multi-owned nature of today's networks offers opportunities to reason about and scalably control networks at a fine grain. An explicit treatment of network resource ownership and trade allows reasoning about acceptable delays. This can lead to scalable mechanisms for fine-grained accounting and reification of control, which make it possible to quantify and control network utilization. We bring together ownership, fine-grained accounting, and reification of control in a model for resource acquisition and control called CyberOrgs. Cyberorgs encapsulate distributed computations with resources required for their execution. A cyberorg acquires resources required by its computations by buying them from other cyberorgs using eCash. We present a novel approach for implementing fine-grained network resource control based on the CyberOrgs model. A prototype implementation is described with experimental results illustrating the effectiveness of control. © 2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A semi-distributed axiomatic game theoretical mechanism for replicating data objects in large distributed computing systems

A semi-distributed axiomatic game theoretical mechanism for ...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Khan, Samee Ullah Ahmad, Ishfaq Department of Computer Science and Engineering University of Texas Arlington TX 76019 United States

ISBN: (纸本)1424409101

Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, which is NP-complete in general. A majority of conventional replica placement techniques falter on issues of scalability or solution quality. To counteract such issues, we propose a game theoretical replica placement technique, in which computational agents compete for the allocation or reallocation of replicas onto their servers in order to reduce the user perceived access delays. The technique is based upon six well-defined axioms, each guaranteeing certain basic game theoretical properties. This eccentric method of designing game theoretical techniques using axioms is unique in the literature and takes away from the designers the cumbersome mathematical details of game theory. The distinctive feature of these axioms is that when amassed together, their individual properties constrict into one system-wide performance enhancement property, which in our case is the reduction of access time. The control of the proposed technique is "semi-distributed" in nature, wherein all the heavy processing is done on the servers of the distributed system and the central body is only required to take a binary decision: (0) not to replicate or (1) to replicate. This semi-distributed approach makes the technique scalable and helps solutions to converge in a fast turn-around time without loosing much of the solution quality. Experimental comparisons are made against: 1) branch and bound, 2) greedy, 3) genetic, 4) Dutch auction, and 5) English auction. As attested by the results, the proposed technique maintains superior solution quality in terms of lower communication cost and reduced execution time. © 2007 ieee.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

parallel I/O performance characterization of Columbia and NEC SX-8 superclusters

Parallel I/O performance characterization of Columbia and NE...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Saini, Subhash Talcott, Dale Thakur, Rajeev Adamidis, Panagiotis Rabenseifner, Rolf Ciotti, Robert NASA Advanced Supercomputing Division NASA Ames Research Center Moffett Field CA 94035-1000 United States Mathematics and Computer Science Division Argonne National Laboratory Argonne IL 60439 United States German Climate Computing Center Hamburg Germany High Performance Computing Center University of Stuttgart Nobelstrasse 19 D-70569 Stuttgart Germany

ISBN: (纸本)1424409101

Many scientific applications running on today's supercomputers deal with increasingly large data sets and are correspondingly bottlenecked by the time it takes to read or write the data from/to the file system. We therefore undertook a study to characterize the parallel I/O performance of two of today's leading parallel supercomputers: the Columbia system at NASA Ames Research Center and the NEC SX-8 supercluster at the University of Stuttgart, Germany. On both systems, we ran a total of seven parallel I/O benchmarks, comprising five low-level benchmarks: (i) IO_Bench, (ii) MPI Tile IO, (iii) IOR (POSIX and MPI-IO), (iv) b_eff_io (five different patterns), and (v) SPIOBENCH, and two scalable synthetic compact application (SSCA) benchmarks: (a) HPCS (High Productivity Computing Systems) SSCA #3 and (b) FLASH IO (parallel HDF5). We present the results of these experiments characterizing the parallel I/O performance of these two systems. ©2007 ieee.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Nonuniformly communicating noncontiguous data: A case study with PETSc and MPI

Nonuniformly communicating noncontiguous data: A case study ...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Balaji, P. Buntinas, D. Balay, S. Smith, B. Thakur, R. Gropp, W. Mathematics and Computer Science Division Argonne National Laboratory

ISBN: (纸本)1424409101

Due to the complexity associated with developing parallel applications, scientists and engineers rely on high-level software libraries such as PETSc, ScaLAPACK and PESSL to ease this task. Such libraries assist developers by providing abstractions for mathematical operations, data representation and management of parallel layouts of the data, while internally using communication libraries such as MPI and PVM. With high-level libraries managing data layout and communication internally, it can be expected that they organize application data suitably for performing the library operations optimally. However, this places additional overhead on the underlying communication library by making the data layout noncontiguous in memory and communication volumes (data transferred by a process to each of the other processes) nonuniform. In this paper, we analyze the overheads associated with these two aspects (noncontiguous data layouts and nonuniform communication volumes) in the context of the PETSc software toolkit over the MPI communication library. We describe the issues with the current approaches used by MPICH2 (an implementation of MPI), propose different approaches to handle these issues and evaluate these approaches with micro-benchmarks as well as an application over the PETSc software library. Our experimental results demonstrate close to an order of magnitude improvement in the performance of a 3-D Laplacian multi-grid solver application when evaluated on a 128 processor cluster. ©2007 ieee.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Architectural considerations for efficient software execution on parallel microprocessors

Architectural considerations for efficient software executio...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Vadlamani, Srinivas Jenks, Stephen Dept. of Electrical Engineering and Computer Science University of California Irvine CA United States

ISBN: (纸本)1424409101

Chip Multiprocessors (CMPs) and Simultaneous Multithreading (SMT) processors provide high performance but put more pressure on the memory interface than their single-thread counterparts. The "memory wall" problem is exacerbated, by multiple threads sharing a memory interface, and will get worse as more cores are added. Therefore, communications between cores, using shared caches or fast interconnects between private caches, are needed to keep the CPUs busy without burdening the memory interface. Multiple CMP systems add another dimension to this challenging problem, as the communication mechanism is no longer uniform. To parallelize data-intensive applications for high performance on these systems, one must explore a number of execution behaviors in a complex architecture-dependent exercise that entails identifying key components of the communication subsystem and understanding their behavior under varying workloads. As part of ongoing research into efficient program execution models for parallel microprocessors, we have developed a tool to evaluate the performance of the storage controllers at different levels of the memory hierarchy under varying workloads and measure cache coherence overhead. The tool allows exploration of architectural features of real processors that affect the performance of several parallel execution approaches. Here, we demonstrate its use by evaluating two of our parallel programming models that employ architecture-specific optimizations and compare them to a conventional model for several applications on parallel microprocessors. © 2007 ieee.

关键词： Microprocessor chips

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 5th ieee Workshop on Challenges of Large Applications in distributed Environments, CLADE'07

Proceedings of the 5th IEEE Workshop on Challenges of Large ...

引用

16th International symposium on High Performance distributed Computing 2007, HPDC'07 and Co-Located Workshops

ISBN: (纸本)1595937145

The proceedings contain 5 papers. The topics discussed include: enabling rapid development of parallel tree search applications;challenges in executing large parameter sweep studies across widely distributed computing environments;hyperscaling of plasma turbulence simulations in DEISA;WISDOM-II: a large in silico docking effort for finding novel hits against malaria using computational grid infrastructure;and efficient processing of pathological images using the grid: computer-aided prognosis of neuroblastoma.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Gossip-based reputation aggregation for unstructured peer-to-peer networks

Gossip-based reputation aggregation for unstructured peer-to...

引用

21st International parallel and distributed processing symposium, IPDPS 2007

作者： Zhou, Runfang Hwang, Kai University of Southern California Los Angeles CA 90089

ISBN: (纸本)1424409101

Peer-to-Peer (P2P) reputation systems are needed to evaluate the trustworthiness of participating peers and to combat selfish and malicious peer behaviors. The reputation system collects locally generated peer feedbacks and aggregates them to yield global reputation scores. Development of decentralized reputation system is in great demand for unstructured P2P networks since most P2P applications on the Internet are unstructured. In the absence of fast hashing and searching mechanisms, how to perform efficient reputation aggregation is a major challenge on unstructured P2P computing. We propose a novel reputation aggregation scheme called GossipTrust. This system computes global reputation scores of all nodes concurrently. By resorting to a gossip protocol and leveraging the power nodes, GossipTrust is adapted to peer dynamics and robust to disturbance by malicious peers. Simulation experiments demonstrate the system as scalable, accurate, robust and fault-tolerant. These results prove the claimed advantages in low aggregation overhead, storage efficiency, and scoring accuracy in unstructured P2P networks. With minor modifications, the system is also applicable to structured P2P systems with projected better performance. © 2007 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：