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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,501 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,574 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,572 篇 英文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2574 条记录，以下是171-180 订阅

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

详细简洁

排序：

Scalable distributed Consensus to Support MPI Fault Tolerance

Scalable Distributed Consensus to Support MPI Fault Toleranc...

引用

26th ieee international parallel and distributed processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Buntinas, Darius Argonne Natl Lab Argonne IL 60439 USA

ISBN: (纸本)9780769546759

As system sizes increase, the amount of time in which an application can run without experiencing a failure decreases. Exascale applications will need to address fault tolerance. In order to support algorithm-based fault tolerance, communication libraries will need to provide fault-tolerance features to the application. One important fault-tolerance operation is distributed consensus. this is used, for example, to collectively decide on a set of failed processes. this paper describes a scalable, distributed consensus algorithm that is used to support new MPI fault-tolerance features proposed by the MPI 3 Forum's fault-tolerance working group. the algorithm was implemented and evaluated on a 4,096-core Blue Gene/P. the implementation was able to perform a full-scale distributed consensus in 222 mu s and scaled logarithmically.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

the Improved Earliest Deadline First with Virtual Deadlines Mixed-Criticality Scheduling Algorithm 15

The Improved Earliest Deadline First with Virtual Deadlines ...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Zhao, Xuejing Wei, Yehua Li, Wenjia Hunan Normal Univ Sch Phys & Informat Sci Changsha Hunan Peoples R China New York Inst Technol Dept Comp Sci New York NY USA

ISBN: (纸本)9781538637906

the current trend in embedded systems towards integrating multiple functionalities with different degrees of criticalities on a shared computing platform. the concept of mixed-criticality system has been presented and is becoming common in embedded systems. the scheduling problem for mixed-criticality systems has become a hot research topic. A algorithm called EDF-VD was proposed for mixed-criticality systems, it can make a better performance guarantee. In order to increase the number of schedulable tasks, an improved mixed-criticality scheduling algorithm based on EDF-VD is proposed. In the proposed algorithm, a probabilistic parameter is introduced to represent the probability that the execution time of high criticality task exceeding the worst execution time at its low criticality mode, and sufficient conditions that the mixed-criticality task instances can be scheduled are derived. Simulation results show that the number of schedulable tasks in the proposed algorithm is more than the EDF-VD algorithm.

关键词： mixed criticality task scheduling virtual deadline

来源：评论

学校读者我要写书评

暂无评论

Understanding Users' Coupon Usage Behaviors in E-Commerce Environments 15

Understanding Users' Coupon Usage Behaviors in E-Commerce En...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： He, Jiawei Jiang, Wenjun Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China

ISBN: (纸本)9781538637906

Issuing discount shopping coupons is a popular way to promote sales in E-commerce environments. However, it is unclear that whether a customer will use the coupon or not. In order to improve the coupon usage ratio, it is important to predict the probability in which a user will use a coupon. In this paper, we treat the coupon usage probability prediction problem as a binary classification problem, and we use machine learning methods to analyze users' coupon usage behaviors. We conduct extensive data analysis on users' coupon usage behavior data, provided by Alibaba in Tianchi platform. Our method gains a good prediction result (with the AUC of around 0.78). Besides that, we find some important factors/features that can significantly impact users' coupon usage behaviors. We also find the "old user effect." Moreover, we find some overfitting features that have little effects and remove them. those findings can guide merchants to issue proper coupons to proper customers.

关键词： E-commerce coupon usage behavior machine learning

来源：评论

学校读者我要写书评

暂无评论

QoS Promotion for Energy-Efficient Datacenters by Regulating Overloaded Workloads 15

QoS Promotion for Energy-Efficient Datacenters by Regulating...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Hu, Cheng Deng, Yuhui Jinan Univ Dept Comp Sci Guangzhou 510632 Guangdong Peoples R China Chinese Acad Sci Inst Comp State Key Lab Comp Architecture Beijing 100190 Peoples R China

ISBN: (纸本)9781538637906

On-demand hardware resources provisioning is an efficient way to save energy in traditional data centers. However, when workloads burst and exceed the capacity of provided resources, the capacity will temporary deficit. that's because a specific time is needed to increase the quantity of resources. thus, performance degradation is incurred. To alleviate this problem, this paper proposes a peak load regulation method to promote the QoS of workloads for traditional energy-efficient DCs. In this method, overloaded workloads (peak loads) are regulated to improve the response time of critical requests and increase the number of QoS-guaranteed requests. Experimental results show that, with this method the energy consumption of the data center can be reduced by about 25% compared with the baseline. What's more, this method can significantly promote the QoS of workloads.

关键词： Quality of service Time factors Servers Hardware Energy consumption Data centers Degradation

来源：评论

学校读者我要写书评

暂无评论

parallel analysis of TACLeBench kernel benchmark's loop and procedure level speculation 19

Parallel analysis of TACLeBench kernel benchmark's loop and ...

引用

19th ieee international symposium on parallel and distributed processing with applications (ieee ISPA)

作者： Meng, Huiling Wang, Yaobin Li, Ling Musariri, Manasah Wang, Xinyi Southwest Univ Sci & Technol Mianyang Sichuan Peoples R China

ISBN: (纸本)9781665435741

thread level speculation (TLS) technology has gained substantial international recognition due to its unique parallel program execution. It uses the potential parallel execution of programs to improve the utilization of multi-core resources. However, the kernel benchmark of TACLeBench has not effectively been analyzed using TLS parallelization. In response to this problem, we select 7 programs in the TACLeBench kernel benchmark to analyze its loop and procedure level speculation executions to measure their maximum potential parallelism. Furthermore, we discuss its runtime characteristics (thread size, speculative parallelism coverage, dependency feature) and the influence of program source code on speedup. Our experimental results illustrate that: 1) Most applications achieve impressive results. Bsort reaches 20.79x speedup in loop level speculation, and lms has 9.51x speedup in procedure level speculation;2) By using TLS to accelerate the TACLeBench kernel benchmark, most applications effectively utilize computing resources from 4 to 16 cores;3) the kernel benchmark is more suitable for developing parallelism in loop level speculation.

关键词： thread level speculation (TLS) multi-core TACLeBench

来源：评论

学校读者我要写书评

暂无评论

Massivizing Multi-Player Online Games on Clouds 13

Massivizing Multi-Player Online Games on Clouds

引用

13th ieee/ACM international symposium on Cluster, Cloud, and Grid Computing (CCGrid)

作者： Shen, Siqi Iosup, Alexandru Epema, Dick Delft Univ Technol Parallel Distributed Syst Grp Delft Netherlands

ISBN: (纸本)9780769549965;9781467364652

Massively Multiplayer Online Games (MMOGs) are an important type of distributed applications and have millions of users. Traditionally, MMOGs are hosted on dedicated clusters, distributed globally. With the advent of cloud computing, MMOGs such as Zynga's are increasingly run on cloud resources, through the use of cloud technology and innovation. Massivizing MMOGs on clouds is the focus of my PhD research. My main contributions are: 1) analyzing and modeling various MMOG workloads, including those of social and traditional real-time games, 2) designing and implementing a cost-efficient and reliable cloud-based MMOG platform, 3) designing and implementing a scalable MMOG system which employs domain-specific scaling techniques to support the real-time strategy games of the future, 4) experimental prototypes and tools to evaluate our proposed research via real-world experimentation and simulation, and applying our proposed research to a popular real-world application. In this article, I introduce my research progress and my future plans.

关键词： Clouds Research Proposal Game theory CLOUDS

来源：评论

学校读者我要写书评

暂无评论

Fast Communication-Aware Virtual Machine Dynamic Consolidation for Cloud Data Center 15

Fast Communication-Aware Virtual Machine Dynamic Consolidati...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Cao, Guangyi Zhang, Changshu Liu, Wei Wuhan Univ Technol Sch Comp Sci Wuhan Hubei Peoples R China Rocket Software Denver CO USA

ISBN: (纸本)9781538637906

With help of virtualization technology, cloud data centers provide affordable computation power to numerous enterprises and business users. Virtual machine dynamic consolidation is considered as an approach that can effectively save energy consumption of cloud data centers and improve its run time efficiency. However, most existing approaches perform virtual machine dynamic consolidation without considering communication traffic between VMs. Such kind of approaches may lead to unsatisfactory consolidation result because inappropriate consolidation may exacerbate inter-rack traffic, making upper level switches performance bottlenecks for the entire system. In this paper, we propose a fast communication-aware consolidation approach based on a distributed architecture. We modify SCAN algorithm to discover VM communication topology. the most attractive benefit of SCAN is its low computation cost. According to such communication topology information, we propose a dynamic consolidation heuristic that can mitigate inter-rack traffic. through extensive simulations, we show effectiveness of our approach and its advantage over state of arts in terms of energy saving, average traffic through core switches and task response time.

关键词： VM dynamic consolidation communication topology energy efficiency cloud data center inter-rack traffic

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation of SHA256 on Multizone Heterogeneous Systems 21

Parallel Implementation of SHA256 on Multizone Heterogeneous...

引用

21st ieee international symposium on parallel and distributed processing with applications, 13th ieee international Conference on Big Data and Cloud Computing, 16th ieee international Conference on Social Computing and Networking and 13th international Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Luo, Yongtao Liu, Jie Xiao, Tiaojie Gong, Chunye National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Digitizing Program for Frontier Equipment Changsha China National Supercomputer Center in Tianjin Tianjin China

ISBN: (纸本)9798350329223

SHA-256 plays an important role in widely used applications, such as data security, data integrity, digital signatures, and cryptocurrencies. However, most of the current optimized implementations of SHA-256 are based on CPUs or dedicated hardware, such as ASICs and FPGAs. Consequently, there is a need to explore whether new heterogeneous parallel framework can improve the computational performance of the hash function. To address this issue, we conducted a study on the MT-3000 platform, which is a special architecture processor for the next-generation exascale prototype supercomputer. We proposed MT-SHA256, a heterogeneous multistage parallel implementation for hashing multiple messages on the MT-3000. Combining the architectural features of this processor, we developed an effective solution that significantly improved the computational performance of SHA-256. As a result, MT-SHA256 achieved a maximum throughput of 1045.68 MB/s on a single acceleration core of MT-3000. this is 9.84x higher than the C code implementation on one CPU core of MT-3000. We also performed a scalability test and found that MT-SHA256 achieved a throughput of 98.04 GB/s on a computing node, and extended to 512 nodes (2048 acceleration clusters) on this system with good scalability. © 2023 ieee.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Discouraging free riding in a peer-to-peer CPU-sharing grid

Discouraging free riding in a peer-to-peer CPU-sharing grid

引用

13th ieee international symposium on High Performance distributed Computing (HPDC-13)

作者： Andrade, N Brasileiro, F Cirne, W Mowbray, M Univ Fed Campina Grande Dept Sistemas & Comp Campina Grande Brazil

ISBN: (纸本)0780321754

Grid computing has excited many with the promise of access to huge amounts of resources distributed across the globe. However there are no largely, adopted solutions for automatically assembling grids, and this limits the scale of today's grids. Some argue that this is due to the overwhelming coinplexity of the proposed economy-based solutions. Peer-to-peer grids have emerged as a less complex alternative. We are currently deploying OurGrid, one such peer-to-peer grid. OurGrid is a CPU-sharing grid that targets Bag-of-Tasks applications (i.e. parallel applications whose tasks are independent). In order to ease system deployment, OurGrid is based on a very lightweight autonomous reputation scheme. Free riding is an iniportant issue for any peer-to-peer system. the aim of this paper is to show that OurGrid's reputation system successfully discourages free riding, making it in each peer's own interest to collaborate with the peer-to-peer community We show this in two steps. First, we analyze the conditions under which a reputation scheme can discourage free riding in a CPU-sharing grid. Second, we show that OurGrid's reputation scheme satisfies these conditions, even in the presence of malicious peers. Unlike other distributed mechanisms for discouraging free riding, OurGrid's reputation scheme achieves this without requiring a shared cryptographic infrastructure or specialized storage..

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Enhancing Java Streams API with PowerList Computation 34

Enhancing Java Streams API with PowerList Computation

引用

34th ieee international parallel and distributed processing symposium (IPDPS)

作者： Niculescu, Virginia Bufnea, Darius Sterca, Adrian Babes Bolyai Univ Fac Math & Comp Sci Cluj Napoca Romania

ISBN: (纸本)9781728174457

Since they were introduced, Java streams were very fast embraced by the industry, being currently used at a large scale. the parallelism enabled by them is very easy to achieve, but it is constrained either by the used parallelism model (in some cases), or by the set of operations that could be specified using streams. We investigate in this paper the possibility to enhance the computation types that could be defined using the Java streams API by introducing into this infrastructure the PowerList theory based computation. Powerlists are recursive data structures that together with their associated algebraic theory offer both abstractions in order to ease the development of parallel applications, and also a methodology to design parallel algorithms. the Java streaming infrastructure could be adapted to support them in a great measure. We present here such an adaptation, and we analyse and discuss the advantages and constraints. this analysis is exemplified by application examples.

关键词： parallel programming streams recursive structures Java performance models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：