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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

79 篇 会议
12 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

52 篇 工学
- 48 篇 计算机科学与技术...
- 36 篇 软件工程
- 11 篇 信息与通信工程
- 10 篇 控制科学与工程
- 5 篇 电气工程
- 4 篇 电子科学与技术（可...
- 3 篇 动力工程及工程热...
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 环境科学与工程（可...
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 1 篇 仪器科学与技术
19 篇 管理学
- 17 篇 管理科学与工程(可...
- 10 篇 工商管理
- 3 篇 图书情报与档案管...
16 篇 理学
- 8 篇 数学
- 3 篇 生物学
- 2 篇 物理学
- 2 篇 化学
- 2 篇 大气科学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
4 篇 医学
- 2 篇 基础医学(可授医学...
- 2 篇 临床医学
- 2 篇 药学(可授医学、理...
3 篇 法学
- 2 篇 社会学
- 1 篇 法学
2 篇 经济学
- 2 篇 应用经济学
1 篇 教育学
- 1 篇 教育学
1 篇 艺术学

主题

13 篇 resource managem...
13 篇 quality of servi...
8 篇 computational mo...
8 篇 distributed comp...
6 篇 concurrent compu...
6 篇 time factors
5 篇 computer science
5 篇 grid computing
5 篇 interference
4 篇 parallel algorit...
4 篇 linux
4 篇 throughput
4 篇 processor schedu...
4 篇 benchmark testin...
3 篇 runtime
3 篇 data processing
3 篇 scheduling algor...
3 篇 application soft...
3 篇 containers
3 篇 process control

机构

5 篇 parallel and dis...
5 篇 department of co...
5 篇 parallel and dis...
5 篇 high performance...
5 篇 karlstad univers...
4 篇 school of comput...
4 篇 high performance...
4 篇 parallel and dis...
3 篇 school of scienc...
3 篇 high-performance...
3 篇 college of compu...
3 篇 school of comput...
3 篇 center for paral...
3 篇 the university o...
3 篇 center of high p...
3 篇 rmit university ...
3 篇 parallel and dis...
2 篇 parallel and dis...
2 篇 high-performance...
2 篇 center for distr...

作者

19 篇 albert y. zomaya
18 篇 li kuan-ching
18 篇 yang chao-tung
14 篇 zomaya albert y.
8 篇 javid taheri
8 篇 zahir tari
5 篇 kuan-ching li
5 篇 hsu ching-hsien
5 篇 m. reza hoseinyf...
5 篇 chao-tung yang
4 篇 p. banerjee
4 篇 tari zahir
4 篇 lee liang-teh
4 篇 hoseinyfarahabad...
4 篇 taheri javid
4 篇 li wei
4 篇 lee young choon
4 篇 young choon lee
4 篇 m.reza hoseinyfa...
3 篇 grunzke richard

语言

92 篇 英文

检索条件"机构=Center for Distributed and High Performance Computing"

共 92 条记录，以下是51-60 订阅

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

详细简洁

排序：

Parallel algorithms for force directed scheduling of flattened and hierarchical signal flow graphs

Parallel algorithms for force directed scheduling of flatten...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： P. Prabhakaran P. Banerjee Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana IL USA Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

In this paper we present some novel algorithms for scheduling hierarchical signal flow graphs in the domain of high-level synthesis. There are several key contributions of this paper. First, we develop a novel extension of the force directed scheduling problem which naturally handles loops and conditionals by coming up with a scheme of scheduling hierarchical signal flow graphs. Second, we develop three new parallel algorithms for the scheduling problem. Third, our parallel algorithms are portable across a wide range of parallel platforms. We report results on a set of high-level synthesis benchmarks on 8-processor SGI Challenge and a network of 4 SUN SPARCstation5 work stations. Finally, while some parallel algorithms for VLSI CAD reported by earlier researchers have reported a loss of qualities of results, our parallel algorithms produce exactly the same results as the sequential algorithms on which they are based.

关键词： Parallel algorithms Flow graphs Processor scheduling Concurrent computing Scheduling algorithm Contracts Cost function Broadcasting

来源：评论

学校读者我要写书评

暂无评论

On utilization of the grid computing technology for video conversion and 3D rendering

On utilization of the grid computing technology for video co...

引用

3rd International Symposium on Parallel and distributed Processing and Applications, ISPA 2005

作者： Yang, Chao-Tung Lai, Chuan-Lin Li, Kuan-Ching Hsu, Ching-Hsien Chu, William C. High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan

ISBN: (纸本)3540297693

In this paper, we investigate the recent popular computing technique called Grid computing, and use video conversion and 3D rendering applications to demonstrate this technology's effectiveness and high performance. We also report on developing a resource broker called Phantom that runs on our grid computing testbed and whose main function is querying nodes in grid computing environments and showing their system information to aid in selecting the best nodes for job assignments to have the jobs executed in the least amount of time. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

Visuel: A novel performance monitoring and analysis toolkit for cluster and grid environments

引用

6th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP

作者： Li, Kuan-Ching Cheng, Hsiang-Yao Yang, Chao-Tung Hsu, Ching-Hsien Wang, Hsiao-Hsi Hsu, Chia-Wen Hung, Sheng-Shiang Chang, Chia-Fu Liu, Chun-Chieh Pan, Yu-Hwa Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan

ISBN: (纸本)3540292357

The computing power provided by high performance low-cost PC-based Cluster and Grid platforms are attractive, and they are equal or superior to supercomputers and mainframes widely available. In this research paper, we present the design rationale and implementation of Visuel, a toolkit for performance measurement and analysis of MPI parallel programs and real time resources monitoring in cluster and grid computing environments. The proposed toolkit is web-based interface to show performance activities of all computing nodes involved in the execution of a MPI parallel program, such as CPU and memory usage levels of each computing node, and monitors all computing nodes of a computing platform by displaying real time performance data. In addition, this toolkit is able to display comparative performance data charts of multiple executions of MPI parallel application under investigation, which facilitates the "what-if" analysis. The usage of this toolkit shows that it outperforms in easing the process of investigation of parallel applications. © Springer-Verlag Berlin Heidelberg 2005.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Replication Mechanism to Reduce Response-Time of I/O Operations in high performance computing Clusters

A Dynamic Replication Mechanism to Reduce Response-Time of I...

引用

IEEE International Conference on Social computing (SocialCom)

作者： Ehsan Mousavi Khaneghah Seyedeh Leili Mirtaheri Lucio Grandinetti Amir Saman Memaripour Mohsen Sharifi Center of High Performance Computing for Parallel and Distributed Processing University of Calabria Rende Italy School of Computer Engineering Iran University of Science and Technology Tehran Iran

ISBN: (纸本)9781479915194

Extraordinary large datasets of high performance computing applications require improvement in existing storage and retrieval mechanisms. Moreover, enlargement of the gap between data processing and I/O operations' throughput will bound the system performance to storage and retrieval operations and remarkably reduce the overall performance of high performance computing clusters. File replication is a way to improve the performance of I/O operations and increase network utilization by storing several copies of every file. Furthermore, this will lead to a more reliable and fault-tolerant storage cluster. In order to improve the response time of I/O operations, we have proposed a mechanism that estimates the required number of replicas for each file based on its popularity. Besides that, the remaining space of storage cluster is considered in the evaluation of replication factors and the number of replicas is adapted to the storage state. We have implemented the proposed mechanism using HDFS and evaluated it using MapReduce framework. Evaluation results prove its capability to improve the response time of read operations and increase network utilization. Consequently, this mechanism reduces the overall response time of read operations by considering files' popularity in replication process and adapts the replication factor to the cluster state.

关键词： Time factors high performance computing Bandwidth Reliability Throughput System performance History

来源：评论

学校读者我要写书评

暂无评论

A mathematical model for empowerment of Beowulf clusters for exascale computing

A mathematical model for empowerment of Beowulf clusters for...

引用

International Conference on high performance computing & Simulation (HPCS)

作者： Seyedeh Leili Mirtaheri Ehsan Mousavi Khaneghah Lucio Grandinetti Mohsen Sharifi Center of High Performance Computing for Parallel and Distributed Processing University of Calabria Rende Italy School of Computer Engineering Iran University of Science and Technology Tehran Iran

high-performance computing (HPC) clusters are currently faced with two major challenges - namely, the dynamic nature of new generation of applications and the heterogeneity of platforms - if they are going to be useful for exascale computing. Processes running these applications may well demand unpredictable requirements and changes to system configuration and capabilities at runtime, thereby requiring fast system response without sacrificing the transparency and integrity of the reconfigured empowered system that is running on a heterogeneous platform. While a challenge in and of itself, platform heterogeneity is both useful and instrumental in the handling of unpredictable requests. The realization of such a dynamically reconfigurable and heterogeneous HPC cluster system for exascale computing requires a model to guide running processes to determine if they need empowerment of the current cluster, and if yes, by how much. To show the feasibility of empowerment of traditional HPC clusters for exascale computing, we have selected Beowulf as a noble candidate cluster and present a mathematical model for the empowerment of Beowulf clusters for exascale computing (EBEC). We have developed the model in line with Beowulf's cluster approach and by using vector space algebra. In contrast to traditional hardware-oriented approaches to improvise the performance of clusters, we use a software approach to the development of the proposed model by emphasizing processes, which act as the creators of the cluster and thus should decide on system (re)configuration, as the principal building blocks of the system. We have also adopted a new approach to heterogeneity by considering heterogeneity at different levels including hardware, system software, application software, and system functionality. In addition to support for heterogeneity and dynamic reconfiguration, the proposed model includes support for scalability that is crucial to exascale computing too.

关键词： Vectors Mathematical model Hardware Runtime Computers Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Reusable software components for performability tools, and their utilization for web-based configurable tools 10th

Reusable software components for performability tools, and t...

引用

10th International Conference on Modelling Techniques and Tools for Computer performance Evaluation, Tools 1998

作者： Van Moorsel, Aad P. A. Huang, Yiqing Distributed Software Research Department Bell Laboratories Research Lucent Technologies 600 Mountain Ave Murray HillNJ07974 United States Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois at Urbana-Champaign 1308 W. Main St UrbanaIL61801 United States

ISBN: (纸本)3540649492

This paper discusses software reusability strategies for performance and reliability modeling tools. Special emphasis is on web-embedded tools, and the potential interaction between such tools. We present the system analysis tools (SAT) application programming interface, which allows for quickly embedding existing tools in the web, and generally simplifies programming analysis tools by structured reuse. We also introduce the FREUD project, which has as primary aim to establish a single point of access to a variety of web-enabled tools. In addition, FREUD facilitates configurable web tools by allowing a user to select from the registered modeling formalisms, solvers and graphics tools, and by providing glue between the tools through scripting. We will argue that this form of reuse is particularly suitable for performability modeling tools because of their predictable usage pattern. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Parallel algorithms for simultaneous scheduling, binding and floorplanning in high-level synthesis

Parallel algorithms for simultaneous scheduling, binding and...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： P. Prabhakaran P. Banerjee Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana-Champaign IL USA Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

With small device features in submicron technologies, interconnection delays play a dominant part in cycle time. Hence, it is important to consider the impact of physical design during high level synthesis. In comparison to a traditional approach which separates high-level synthesis from physical design, an algorithm which is able to make these stages interact very closely, would result in solutions with lower latency and area. However, such an approach could result in increased runtimes. Parallel processing is an attractive way of reducing the runtimes. In this paper, two parallel algorithms for simultaneous scheduling, binding and floorplanning algorithm are presented. A detailed hardware model is considered, taking into account multiplexor and register areas and delays. Experimental results are reported on an IBM SP-2 multicomputer, with close to linear speedups for a set of benchmark circuits.

关键词： Parallel algorithms high level synthesis Runtime Integrated circuit interconnections Delay effects Algorithm design and analysis Parallel processing Scheduling algorithm Hardware Registers

来源：评论

学校读者我要写书评

暂无评论

Disk Throughput Controller for Cloud Data-centers

Disk Throughput Controller for Cloud Data-Centers

引用

IEEE International Conference on Parallel and distributed computing, Applications and Technologies (PDCAT)

作者： M. Reza Hoseinyfarahabady Zahir Tari Albert Y. Zomaya Center for Distributed & High Performance Computing School of Computer Science The University of Sydney New South Wales Australia School of Science RMIT University Melbourne VIC Australia

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

With the increasing popularity of virtual machine monitoring (VMM) technologies, performance variability among collocated virtual machines (VMs) can easily become a severe scalability issue. Particularly, it becomes a necessary for administrative team to control the performance degradation level in a shared environment when multiple I/O-intensive applications simultaneously request their I/O operations [1]. Nevertheless, adding several logical layers between the running applications and the physical storage system, as seen in contemporary virtualized storage devices, makes it considerably difficult to build a low overhead controlling mechanism for such systems (while each VM may running a separate operating system instance) [2]. In this paper, we propose a strategy based on control theory for managing the performance of several I/O requests, such as mean response times and read/write throughput in a consolidated environment where multiple virtual services can share access to a storage system. This scheme uses an approach for measuring the characterization of read/write performance attributes of each virtual services and also takes into account the run-time quality of service enforcement levels requested by them. This is formulated as an optimization problem where a reward function is defined to reduce the overall QoS violation incidents among all consolidated virtual services. performance evaluation is carried out by comparing the proposed solution with the default embedded Linux controller across a range of emulated application workloads in scenarios with multiple consolidated virtual containers. The results confirm that the proposed solution can reduce the overall QoS violation incident rates in scenarios in which the platform operates at a significant traffic load comparing to the default policy in LXC engine.

关键词： Quality of service Virtual machine monitors performance evaluation Containers Interference Linux Resource management

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Resource Controller for Resolving Quality of Service Issues in Modern Streaming Processing Engines

A Dynamic Resource Controller for Resolving Quality of Servi...

引用

IEEE International Symposium on Network computing and Applications

作者： M. Reza HoseinyFarahabady Javid Taheri Albert Y. Zomaya Zahir Tari The University of Sydney School of Computer Science Center for Distributed and High Performance Computing NSW Australia Karlstad University Sweden RMIT University School of Science Victoria Australia

ISBN: (数字)9781728183268

ISBN: (纸本)9781728183275

Devising an elastic resource allocation controller of data analytical applications in virtualized data-center has received a great attention recently, mainly due to the fact that even a slight performance improvement can translate to huge monetary savings in practical large-scale execution. Apache Flink is among modern streamed data processing run-times that can provide both low latency and high throughput computation in to execute processing pipelines over high-volume and high-velocity data-items under tight latency constraints. However, a yet to be answered challenge in a large-scale platform with tens of worker nodes is how to resolve the run-time violation in the quality of service (QoS) level in a multi-tenant data streaming platforms, particularly when the amount of workload generated by different users fluctuates. Studies showed that a static resource allocation algorithm (round-robin), which is used by default in Apache Flink, suffer from lack of responsiveness to sudden traffic surges happening unpredictably during the run-time. In this paper, we address the problem of resource management in a Flink platform for ensuring different QoS enforcement levels in a platform with shared computing resources. The proposed solution applies theoretical principals borrowed from close-loop control theory to design a CPU and memory adjustment mechanism with the primary goal to fulfill the different QoS levels requested by submitted applications while the resource interference is considered as the critical performance-limiting factor. The performance evaluation is carried out by comparing the proposed resource allocation mechanism with two static heuristics (round robin and class-based weighted fair queuing) in a 80-core cluster under multiple traffic patterns resembling sudden changes in the incoming workloads of low-priory streaming applications. The experimental results confirm the stability of the proposed controller to regulate the underlying platform resources to smo

关键词： Quality of service Data processing Resource management Process control Time factors Degradation Surges

来源：评论

学校读者我要写书评

暂无评论

AsT: An Asymmetric-Sensitive Transformer for Osteonecrosis of the Femoral Head Detection 37

AsT: An Asymmetric-Sensitive Transformer for Osteonecrosis o...

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Chen, Haoyang Liu, Shuai Lu, Feng Li, Wei Sheng, Bin Li, Mi Jin, Hai Zomaya, Albert Y. National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Centre for Distributed and High Performance Computing School of Computer Science The University of Sydney Australia Department of Computer Science and Engineering Shanghai Jiao Tong University China Tongji Hospital Tongji Medical College Huazhong University of Science and Technology China

ISBN: (纸本)9781577358800

Early diagnosis of osteonecrosis of the femoral head (ONFH) can inhibit the progression and improve femoral head preservation. The radiograph difference between early ONFH and healthy ones is not apparent to the naked eye. It is also hard to produce a large dataset to train the classification model. In this paper, we propose Asymmetric-Sensitive Transformer (AsT) to capture the uneven development of the bilateral femoral head to enable robust ONFH detection. Our ONFH detection is realized using the self-attention mechanism to femoral head regions while conferring sensitivity to the uneven development by the attention-shared transformer. The real-world experiment studies show that AsT achieves the best performance of AUC 0.9313 in the early diagnosis of ONFH and can find out misdiagnosis cases firmly. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：