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

Proceedings of the 19th ACM International Symposium on high performance Distributed computing

作者： Jones, William M. Daly, John T. DeBardeleben, Nathan Department of Computer Science Coastal Carolina University Conway SC United States Center for Exceptional Computing Department of Defense Fort Meade MD United States High Performance Computing Los Alamos National Laboratory Los Alamos NM United States

ISBN: (纸本)9781605589428

As computational clusters rapidly grow in both size and complexity, system reliability and, in particular, application resilience have become increasingly important factors to consider in maintaining efficiency and providing improved computational performance over predecessor systems. One commonly used mechanism for providing application fault tolerance in parallel systems is the use of checkpointing. By making use of a multi-cluster simulator, we study the impact of sub-optimal checkpoint intervals on overall application efficiency. By using a model of a 1926 node cluster and workload statistics from Los Alamos National laboratory to parameterize the simulator, we find that dramatically over-estimating the AMTTI has a fairly minor impact on application efficiency while potentially having a much more severe impact on user-centric performance metrics such a queueing delay. We compare and contrast these results with the trends predicted by an analytical model. Copyright 2010 ACM.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Implementation of a Medical Image File Accessing System on Cloud computing

Implementation of a Medical Image File Accessing System on C...

引用

IEEE International Conference on Computational science and engineering, CSE

作者： Chao-Tung Yang Lung-Teng Chen Wei-Li Chou Kuan-Chieh Wang High-Performance Computing Laboratory Department of Computer Science Tunghai University Taichung Taiwan

Large scale cluster based on cloud technologies has been widely used in many areas, including the data center and cloud computing environment. The purpose of presenting the research paper in this field was to solve the challenge in Medical Image exchanging, storing and sharing issues of EMR (Electronic Medical Record). In recent years, many countries invested significant resources on the projects of EMR topics. The benefit of the EMR included: Patient-centered Care, Collaborative Teams, Evidence-based Care, Redesigned Business Processes, Relevant Data Capture and Analysis and Timely Feedback and Education. For instance, the ARRAHIT project in Untied States (2011-2015), Health Infoway project in Canada (2001-2015) and NHIP project in Taiwan, etc. Aim to the topic of EMR, we presented a system called MIFAS (Medical Image File Accessing System) to solve the exchanging, storing and sharing on Medical Images of crossing the different hospitals issues. Through this system we can enhance efficiency of sharing information between patients and their caregivers. Furthermore, the system can make the best-possible patient-care decisions.

关键词： Biomedical imaging Picture archiving and communication systems File systems Hospitals Cloud computing Hardware

来源：评论

学校读者我要写书评

暂无评论

Towards garbage collection mechanism for RTSJ-oriented embedded Java Processor

Towards garbage collection mechanism for RTSJ-oriented embed...

引用

10th IEEE International Conference on computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable computing and Communications, ScalCom-2010

作者： Hu, Guang Chai, Zhilei Zhao, Wenke Tu, Shiliang Department of Computer Science Shanghai International Studies University Shanghai China Department of Computer Science and Engineering Fudan University Shanghai China Siemens Corporate Technology Beijing China Center of Intelligent and High Performance Computing School of Information Technology Jiangnan University Wuxi China

ISBN: (纸本)9780769541082

Currently, Java has been gradually applied in embedded real-time area with the improvement by the Real-Time Specification for Java (RTSJ). Accordingly, a hardware Java execution engine for embedded real-time applications, JPOR-32 (32-bit Java Processor Optimized for RTSJ), is designed. Taking JPOR-32 for an example, this paper presents the garbage collection mechanism for RTSJ-oriented embedded processor in detail. JPOR-32 provides effective architectural support for garbage collection. And the object reference format of JPOR-32 provides supports for objects tracing and heap scanning. The support for write barrier of real-time concurrent GC is also performed. Moreover, JPOR- 32 provides optimized instruction level support for garbage collection. In addition, different garbage collection algorithms are compared on the base of the resource-constrained feature and the real-time requirement of the processor, and the hybrid garbage collectors are suggested. © 2010 IEEE.

关键词： Refuse collection

来源：评论

学校读者我要写书评

暂无评论

Robust task scheduling for volunteer computing systems

Robust task scheduling for volunteer computing systems

引用

作者： Lee, Young Choon Zomaya, Albert Y. Siegel, Howard Jay Centre for Distributed and High Performance Computing School of Information Technologies University of Sydney Sydney NSW 2006 Australia Department of Electrical and Computer Engineering Department of Computer Science Colorado State University Fort Collins CO 80523-1373 United States

performance perturbations are a natural phenomenon in volunteer computing systems. Scheduling parallel applications with precedence-constraints is emerging as a new challenge in these systems. In this paper, we propose two novel robust task scheduling heuristics, which identify best task-resource matches in terms of makespan and robustness. Our approach for both heuristics is based on a proactive reallocation (or schedule expansion) scheme enabling output schedules to tolerate a certain degree of performance degradation. Schedules are initially generated by focusing on their makespan. These schedules are scrutinized for possible rescheduling using additional volunteer computing resources to increase their robustness. Specifically, their robustness is improved by maximizing either the total allowable delay time or the minimum relative allowable delay time over all allocated volunteer resources. Allowable delay times may occur due to precedence constraints. In this paper, two proposed heuristics are evaluated with an extensive set of simulations. Based on simulation results, our approach significantly contributes to improving the robustness of the resulting schedules. © 2009 Springer science+Business Media, LLC.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Measuring the effect of intervening early for academically at risk students in a CS1 course

Measuring the effect of intervening early for academically a...

引用

2010 ASEE Annual Conference and Exposition

作者： Punch, William Enbody, Richard McDonough, Colleen Sticklen, Jon Department of Computer Science Michigan State's High Performance Computing Center Michigan State University United States Department of Computer Science and Engineering Michigan State University United States College of Engineering Michigan State University United States Center for Engineering Education Research Michigan State University United States

We recently converted a CS1 (Introduction to computing) class to use the Python language in place of C++. Among other reasons, we hoped that the new language would help students who typically struggled with the course. Our typical drop+fail rate was around 25%-30% for C++, and we hoped the conversion would reduce this number. Though it did reduce slightly, 15%-25%, it was not as significant as we had hoped. We therefore tried an early intervention strategy to help those students whom we could identify as struggling. We provided extra tutoring for only those students. We then calculated statistics on the effects this extra tutoring. The results were not good: we found no significant difference between the group of students who used the tutoring and those that did not. We review some of the potential reasons for this result. © American Society for engineering Education, 2010.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Stretchable Solar Cells: Stretchable GaAs Photovoltaics with Designs That Enable high Areal Coverage (Adv. Mater. 8/2011)

引用

Advanced Materials 2011年第8期23卷

作者： Jongho Lee Jian Wu Mingxing Shi Jongseung Yoon Sang‐Il Park Ming Li Zhuangjian Liu Yonggang Huang John A. Rogers Department of Materials Science and Engineering Frederick Seitz Materials Research Laboratory University of Illinois at Urbana‐Champaign Urbana Illinois 61801 USA Department of Civil and Environmental Engineering Northwestern University Evanston IL 60208 USA Institute of High Performance Computing Singapore 138631 Singapore Department of Engineering Mechanics Dalian University of Technology Dalian 116024 China Departments of Civil and Environmental Engineering and Mechanical Engineering Northwestern University Evanston Illinois 60208 USA Department of Materials Science and Engineering Chemistry Mechanical Science and Engineering Electrical and Computer Engineering Beckman Institute for Advanced Science and Technology and Frederick Seitz Materials Research Laboratory University of Illinois at Urbana‐Champaign Urbana Illinois 61801 USA

来源：评论

学校读者我要写书评

暂无评论

Coverage-maximization in networks under resource constraints

引用

Physical Review E 2010年第6期81卷 061124-061124页

作者： Subrata Nandi Lutz Brusch Andreas Deutsch Niloy Ganguly Department of Computer Science and Engineering Indian Institute of Technology Kharagpur 721302 India Center for Information Services and High Performance Computing Technical University Dresden 01062 Dresden Germany

Efficient coverage algorithms are essential for information search or dispersal in all kinds of networks. We define an extended coverage problem which accounts for constrained resources of consumed bandwidth B and time T. Our solution to the network challenge is here studied for regular grids only. Using methods from statistical mechanics, we develop a coverage algorithm with proliferating message packets and temporally modulated proliferation rate. The algorithm performs as efficiently as a single random walker but O(B(d−2)/d) times faster, resulting in significant service speed-up on a regular grid of dimension d. The algorithm is numerically compared to a class of generalized proliferating random walk strategies and on regular grids shown to perform best in terms of the product metric of speed and efficiency.

关键词： Statistical mechanics

来源：评论

学校读者我要写书评

暂无评论

A web-based tool for the automatic segmentation of cardiac MRI

A web-based tool for the automatic segmentation of cardiac M...

引用

12th Mediterranean Conference on Medical and Biological engineering and computing, MEDICON 2010

作者： De Paula, T.H. Lobosco, M. Dos Santos, R.W. FISIOCOMP: Laboratory of Computational Physiology and High Performance Computing Computer Science Department Federal University of Juiz de Fora Rua José Lourenço Kelmer s/n Bairro São Pedro - CEP: 36036-900 Juiz de For a/MG Brazil

ISBN: (纸本)9783642130380

In this work we describe the initial implementation of a web-based tool for the automatic segmentation of cardiac Magnetic Resonance Images. The application uses an active contours algorithm called Snakes, which are adapted and tailored to the specific task of automatic segmentation of the left ventricle of the heart in Magnetic Resonance Images. The application uses a client-server approach and both the client and the server are implemented in Java. In particular, the server uses threads to explore data parallelism on shared-memory machines. Tests are performed on 150 short-axis images acquired from two healthy volunteers. Preliminary results suggest the proposed methods are promising and with further development and validation may be used, for instance, for the automatic calculation of cardiac ejection fraction. © 2010 International Federation for Medical and Biological engineering.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

A Carbon 2.0 Framework Based on Cloud computing

A Carbon 2.0 Framework Based on Cloud Computing

引用

International Conference on computer and Information science (ACIS)

作者： Jiandun Li Wu Zhang Junjie Peng Zhou Lei Yu Lei School of Computer Engineering & Science High Performance Computing Center Shanghai University Shanghai China Department of Computer Science & Engineering University of Texas Arlington Arlington USA

The Copenhagen climate conference 2009 has concluded that we have to change the way how we live. Currently, several carbon management systems are being developed to meet enterprises' requirement. In addition, a number of carbon footprint calculation tools have been developed to fulfill carbon calculation needs from industries, households and individuals. However, under the current circumstance, it is still a challenging issue on how to take advantage of the latest IT technologies to improve carbon calculations with comprehensive functionality. In this paper, we extend carbon 2.0, the concept proposed by previous studies, and introduce a new carbon framework based on cloud computing. This new framework is massively scalable and can configure and deliver carbon-related services dynamically and on demand. Moreover, it is a real low-carbon framework itself!

关键词： Carbon Carbon dioxide Cloud computing Companies Decision making computer architecture

来源：评论

学校读者我要写书评

暂无评论

Designing topology-aware collective communication algorithms for large scale InfiniBand clusters: Case studies with Scatter and Gather

Designing topology-aware collective communication algorithms...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Krishna Kandalla Hari Subramoni Abhinav Vishnu Dhabaleswar K. Panda Department of Computer Science and Engineering Ohio State Uinversity USA High Performance Computing Group Ohio State Uinversity USA

ISBN: (纸本)9781424465330

Modern high performance computing systems are being increasingly deployed in a hierarchical fashion with multi-core computing platforms forming the base of the hierarchy. These systems are usually comprised of multiple racks, with each rack consisting of a finite number of chassis, and each chassis having multiple compute nodes or blades, based on multi-core architectures. The networks are also hierarchical with multiple levels of switches. Message exchange operations between processes that belong to different racks involve multiple hops across different switches and this directly affects the performance of collective operations. In this paper, we take on the challenges involved in detecting the topology of large scale InfiniBand clusters and leveraging this knowledge to design efficient topology-aware algorithms for collective operations. We also propose a communication model to analyze the communication costs involved in collective operations on large scale supercomputing systems. We have analyzed the performance characteristics of two collectives, MPI_Gather and MPI_Scatter, on such systems and we have proposed topology-aware algorithms for these operations. Our experimental results have shown that the proposed algorithms can improve the performance of these collective operations by almost 54% at the micro-benchmark level.

关键词： Algorithm design and analysis Clustering algorithms Large-scale systems Scattering high performance computing Switches Blades computer architecture Communication switching Network topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：