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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
109 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

2,426 篇 工学
- 2,336 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 336 篇 电气工程
- 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,483 篇 英文
65 篇 其他
1 篇 中文

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

共 3549 条记录，以下是1361-1370 订阅

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

详细简洁

排序：

Fast address translation techniques for distributed shared memory compilers

Fast address translation techniques for distributed shared m...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Cantonnet, François El-Ghazawi, Tarek A. Lorenz, Pascal Gaber, Jaafer Department of Electrical and Computer Engineering George Washington University United States Université de Haute Alsace France Université de Technologie de Belfort-Montbéliard France

ISBN: (纸本)0769523129

The distributed Shared Memory (DSM) model is designed to leverage the ease of programming of the shared memory paradigm, while enabling the high-performance by expressing locality as in the message-passing model. Experience, however, has shown that DSM programming languages, such as UPC, may be unable to deliver the expected high level of performance. Initial investigations have shown that among the major reasons is the overhead of translating from the UPC memory model to the target architecture virtual addresses space, which can be very costly. Experimental measurements have shown this overhead increasing execution time by up to three orders of magnitude. Previous work has also shown that some of this overhead can be avoided by hand-tuning, which on the other hand can significantly decrease the UPC ease of use. In addition, such tuning can only improve the performance of local shared accesses but not remote shared accesses. Therefore, a new technique that resembles the Translation Look Aside Buffers (TLBs) is proposed here. This technique, which is called the Memory Model Translation Buffer (MMTB) has been implemented in the GCC-UPC compiler using two alternative strategies, full-table (FT) and reduced-table (RT). It will be shown that the MMTB strategies can lead to a performance boost of up to 700%, enabling ease-of-programming while performing at a similar performance to hand-tuned UPC and MPI codes.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

distributed parallelism using clusters with dynamic behavior (non-refereed)

Distributed parallelism using clusters with dynamic behavior...

引用

ieee Southeastcon 2005: Excellence in Engineering, Science and Technology

作者： Khan, Md. Sirajul Alam Chowdhury, Md. Nazibul Haque Hoque, Md. Ashraful Khan, Md. Zahedul Alam Dept. of Electrical and Electronic Engineering Rahshahi University of Engineering and Technology Rajshahi Bangladesh Dept. of Computer Engineering American International University-Bangladesh Bangladesh

This paper presents a technique to design and develop a distributed parallel cluster on a client-server network environment to implement parallelism and hence increase the efficiency of a system. A client-server network has been established first. Then necessary packages for cluster management have been installed and configured on the established network environment. Programs run able on the developed environment must follow parallel algorithm properties with selected cluster nodes. Any program is distributed module-wise to run on different nodes simultaneously. processing is done on different nodes, then integrated together to generate the output. distributed parallel system offers a processing power that is the sum of the cluster computing. To run irregular parallel applications from multiple users efficiently on dynamically shared systems, a runtime load manager or a scheduler, a distributed database is a critical component for a Multi User Domain (MUD) server. Application level is preferred to increase the application performance and efficient execution on such environment with a system level scheduler and novel decision making mechanism. From the flexibility and performance, this system is different from a general-purpose cluster system because there are three approaches to describe this system. One is the centralized approach, which uses scheduling, communicating into the network of cluster nodes according to users workload. The second is dynamic approach, which is establishing an internal dynamic cluster network model according to the action of user's workload. The third is distributed approach, which is reservation based: this approach uses local scheduler and communicate with the internal dynamic network of cluster nodes from the existing system for the user's workload. While centralized approach is attractive to support parallel job scheduling and provide predictability, some shortcomings;that is cost for paying a synchronization overhead and higher chance

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

MATLAB/simulink based hardware/software co-simulation for designing using FPGA configured soft processors

MATLAB/simulink based hardware/software co-simulation for de...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Ou, Jingzhao Prasanna, Viktor K. Department of Electrical Engineering University of Southern California Los Angeles CA 90089-2560 United States

ISBN: (纸本)0769523129

FPGA configured soft processors are an attractive choice for implementing many embedded systems. For application development using these soft processors, the users can execute portions of the applications as software programs and the other portions as customized hardware implementations. Being able to rapidly simulate various partitions of the applications on hardware and software is crucial to efficiently execute them on soft processors because (a) there are many possible configurations of soft processors, and (b) low-level simulation techniques are too time consuming for evaluating these different partitioning and configuration possibilities. While state-of-the-art design tools rely on low-level simulation and are unable to deliver such a fast simulation speed, we propose a high-level cycle-accurate hardware/software cosimulation environment based on MATLAB/Simulink for application development using soft processors. By utilizing the high-level cycle-accurate abstractions of the low-level hardware implementations and the arithmetic simulation capability provided by MATLAB/Simulink, our tool considerably accelerates the time for cycle-accurate functional simulation of both hardware and software portions of a given application running on soft processors. To illustrate our approach, we develop a CORDIC division application and a matrix multiplication application on a commercial soft processor. Up to 19.4x improvement in simulation time is achieved using our co-simulation environment compared with that of low-level simulation for various partitions of these applications and for various configurations of the soft processor.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

2nd International symposium on parallel and distributed processing and Applications, ISPA 2004

引用

2nd International symposium on parallel and distributed processing and Applications, ISPA 2004

ISBN: (纸本)9783540241287

The proceedings contain 119 papers. The special focus in this conference is on parallel and distributed processing and Applications. The topics include: Present and future supercomputer architectures;challenges in P2P computing;multihop wireless Ad Hoc networking: current challenges and future opportunities;an inspector-executor algorithm for irregular assignment;multi-grain parallel processing of data-clustering on programmable graphics hardware;a parallel reed-solomon decoder on the imagine stream processor;asynchronous document dissemination in dynamic Ad Hoc networks;location-dependent query results retrieval in a multi-cell wireless;an efficient mobile data mining model;towards correct distributed simulation of high-level petri nets with fine-grained partitioning;m-guard: a new distributed deadlock detection algorithm based on mobile agent technology;meta-based distributed computing framework;locality optimizations for jacobi iteration on distributed parallel;fault-tolerant cycle embedding in the WK-recursive network;RAIDb: redundant array of inexpensive databases;a fault-tolerant multi-agent development framework;a fault tolerance protocol for uploads: design and evaluation;topological adaptability for the distributed token circulation paradigm in faulty environment;adaptive data dissemination in wireless sensor networks;design and analysis of a k-connected topology control algorithm for Ad Hoc networks;on using temporal consistency for parallel execution of real-time queries in wireless sensor systems;cluster-based parallel simulation for large scale molecular dynamics in microscale thermophysics;parallel checkpoint/recovery on cluster of IA-64 computers;an enhanced message exchange mechanism in cluster-based mobile;a scalable low discrepancy point generator for parallel computing;generalized trellis stereo matching with systolic array.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Resource allocation for periodic applications in a shipboard environment

Resource allocation for periodic applications in a shipboard...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Shestak, Vladimir Chong, Edwin K. P. Maciejewski, Anthony A. Siegel, H.J. Benmohamed, Lotfi Wang, I.-Jeng Daley, Rose Colorado State University Department of Electrical and Computer Engineering Fort Collins CO 80523-1373 Colorado State University Department of Computer Science Fort Collins CO 80523-1373 Johns Hopkins University Applied Physics Laboratory 11100 Johns Hopkins Road Laurel MD 20723-6099 Department of Electrical and Computer Engineering Colorado State University Department of Electrical and Computer Engineering Department of Mathematics Colorado State University IEEE Colorado State University Department of Computer Science ACM Eta Kappa Nu Electrical Engineering Honor Society Sigma Xi Science Honor Society Upsilon Pi Epsilon Computing Sciences Honor Society Johns Hopkins University Applied Physics Laboratory JHU/APL Applied Physics Lab. IR and D

ISBN: (纸本)0769523129

Providing efficient workload management is an important issue for a large-scale heterogeneous distributed computing environment where a set of periodic applications is executed. The considered distributed system is expected to operate in an environment where the input workload is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial workload estimate. The tasks consist of multiple application strings, each made up of an ordered sequence of applications. There are quality of service (QoS) constraints that must be satisfied for each string. This work addresses the problem of finding a robust initial allocation of resources to application strings that is able to absorb some level of unknown input workload increase without rescheduling. An allocation feasibility analysis is presented followed by four heuristics for finding a near-optimal allocation of resources. The performance of the proposed heuristics is evaluated and compared using simulation. The proposed heuristics also are compared to a mathematically derived upper bound. © 2005 ieee.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Homogeneous redundancy: A technique to ensure integrity of molecular simulation results using public computing

Homogeneous redundancy: A technique to ensure integrity of m...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Taufer, M. Anderson, D. Cicotti, P. Brooks III, C.L. The Scripps Research Institute San Diego CA 92037 United States Center for Theoretical Biological Physics University of California San Diego San Diego CA 92093 United States Dept. of Computer Science University of Texas El Paso El Paso TX 79968 United States Spaces Sciences Laboratory University of California Berkeley Berkeley CA 94703 United States Dept. of Computer Science University of California San Diego San Diego CA 92093 United States Department of Computer Science University of Texas El Paso U.C. Berkeley Space Sciences Laboratory Seientifi C Computation Group Department of Molecular Biology Scripps Research Institute

ISBN: (纸本)0769523129

distributed computing using PCs volunteered by the public can provide high computing capacity at low cost. However, computational results from volunteered PCs have a non-negligible error rate, so result validation is needed to ensure overall correctness. A generally applicable technique is "redundant computing", in which each computation is done on several separate computers, and results are accepted only if there is a consensus. Variations in numerical processing between computers (due to a variety of hardware and software factors) can lead to different results for the same task. In some cases, this can be addressed by doing a "fuzzy comparison" of results, so that two results are considered equivalent if they agree within given tolerances. However, this approach is not applicable to applications that are "divergent", that is, for which small numerical differences can produce large differences in the results. In this paper we examine the problem of validating results of divergent applications. We present a novel approach called Homogeneous Redundancy (HR), in which the redundant instances of a computation are dispatched to numerically identical computers, allowing strict equality comparison of the results. HR has been deployed in Predictor @ home, a world-wide community effort to predict protein structure from sequence.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A scheduling method for divisible workload problem in grid environments

A scheduling method for divisible workload problem in grid e...

引用

6th International Conference on parallel and distributed Computing, Applications and Technologies, PDCAT 2005

作者： Loc, Nguyen The Elnaffar, Said Katayama, Takuya Bao, Ho Tu Japan Advance Institute of Science and Technology 1-1 Asahidai Nomi Ishikawa 923-1292 Japan College of IT UAE University Al-Ain United Arab Emirates

ISBN: (纸本)0769524052

Scheduling divisible workloads in distributed systems has been one of the interesting research problems over the last few years. Most of the scheduling algorithms previously introduced are based on the master-worker model. However, the majority of these algorithms assume that workers are dedicated machines, which is a wrong assumption in distributed environments such as Grids. In this work, we propose a dynamic scheduling methodology that takes into account the three prominent aspects of Grids: heterogeneity, dynamicity, and uncertainty. Our contribution is threefold. First, we present an analytical model for processing local and Grid tasks at each non-dedicated worker. Second, we present a simple prediction method to forecast the available CPU capacity and bandwidth at each worker. third, we introduce a dynamic, multi-round scheduling algorithm. © 2005 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Multiple ID data parallel wavelet transform

Multiple ID data parallel wavelet transform

引用

7th International symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2005

作者： Onchiş, Darian Marta, Constantin Eftimie Murgu University Reşiţa Romania

ISBN: (纸本)0769524532

With the new trends in signals analysis for permanent improvement of the investigation systems there is a growing demand for fast and smart parallel algorithms to work on 1D long datasets. The idea is to compute the transform coefficients witch usually takes a long processing time even with the fast sequential wavelet algorithms like FWT ([3]), in a close to real time manner using variant number of processors with minimum communication requirements and optimal load balancing. We propose here a parallel method for the wavelet transform of signals based of the SIMD philosophy applied on distributed memory machines. We implemented and optimized the code to work whatever the number of time entries are by introducing a splitting step and dedicating for tests a number of new generation processors on a parallel Linux Cluster. © 2005 ieee.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Mining global association rules on an Oracle Grid by Scanning Once distributed databases

Mining global association rules on an Oracle Grid by Scannin...

引用

11th International Euro-Par Conference

作者： Wang, F Helian, N Ctr Grid Comp Cambridge England London Metropolitan Univ Dept Compo Commun Technol & Math London England

ISBN: (纸本)3540287000

Oracle 10g is a commercial infrastructure specifically designed for enterprise grid computing. On an Oracle Grid, we implement a ScanOnce algorithm to mine global association rules in support of the third generation of data mining systems on distributed and massive data. The ScanOnce algorithm does not need to ship all of local data to one site thereby not causing excessive network communication cost. The power of generating ad hoc queries in SQL ensures fast access to any desired counter.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Enhancing availability of grid computational services to ubiquitous computing applications

Enhancing availability of grid computational services to ubi...

引用

19th ieee International parallel and distributed processing symposium, IPDPS 2005

作者： Roy, Nirmalya Das, Sajal K. Basu, Kalyan Kumar, Mohan Department of Computer Science and Engineering University of Texas at Arlington Arlington TX 76019-0015

ISBN: (纸本)0769523129

The Grid is an integrated infrastructure that can play the dual roles of a coordinated resource consumer as well as a donator in distributed computing environments. In a mobile grid environment, the Grid acts as a resource hungry consumer whereas in ubiquitous computing environments, it has the inherent potential to provide services to applications. The enormous growth in the use of mobile and embedded devices in ubiquitous computing environment and their interaction with human beings produces a huge amount of data that needs to be processed swiftly anytime anywhere. However, most devices used in ubiquitous environments have limited resources in terms of CPU, storage, battery power and communication bandwidth. In such ubiquitous computing platforms, there is a need to transfer application services to computational resources. In this paper, we investigate the use of the Grid as a candidate for provisioning computational services to applications in ubiquitous computing environments. In particular, we present a competitive model that describes the possible interaction between the competing resources in the Grid Infrastructure as service providers and ubiquitous applications as subscribers. The competition takes place in terms of quality of service (QoS) offered by different Grid Service Providers. The ubiquitous users' resource demands depend not only on the QoS parameters (e.g., response time and loss probability in our context) offered by that service provider but also upon those of its competitors. We develop a stochastic equilibrium model for QoS assurance. Based upon those QoS parameters, we propose two types of demand models whose distribution functions are closely correlated with service level QoS parameters. We proceed to present the equilibrium behavior of our model facing global competition under stochastic demand and estimation of guaranteed QoS assurance level satisfying the requirement of ubiquitous application efficiently. Simulation results show that our

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 133 134 135 136 137 138 139 140 141 142 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：