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

Application of a mathematic programming model for integrated planning and scheduling of petroleum supply networks

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2008年第6期47卷 1935-1954页

作者： Kuo, Tung-Hsiung Chang, Chuei-Tin Natl Cheng Kung Univ Dept Chem Engn Tainan 70101 Taiwan

The scope of this study is concerned with the petroleum supply network operated by a typical oil company, in which the crude oil is consumed to produce ethylene, propylene, liquefied petroleum gas, butadiene, benzene, toluene, xylene, gasoline, kerosene, diesel, and other byproducts. These petrochemical products are usually manufactured with a cluster of strategically located conversion refineries.' A complete petroleum supply chain consists of at least 13 different types of production units, that is, the atmospheric distillation units, the vacuum distillation units, the cokers, the fluid catalystic cracking units, the naphtha crackers, the butadiene extraction units, the hydrotreaters, the aromatics extraction units, the reforming units, the xylene fractionation units, the parex units, the xylene isomar units, and the tatory units. Traditionally, the production plan of an industrial supply chain is created first and a compatible schedule is then identified accordingly. Because the detailed scheduling constraints are often ignored in the planning model, there is no guarantee that an operable schedule can be obtained with this hierarchical approach. To address this issue, a single mixed-integer linear program (MILP) has been formulated in this study to coordinate various planning and scheduling decisions for optimizing the supply chain performance. Solving this MILP model yields the proper procurement scheme for crude oils, the schedules for producing various petrochemical products, and the corresponding logistics. The appropriate sources (suppliers) of raw materials, the economic order quantities, the best purchasing intervals, and also the transportation schedules can be identified accordingly. In particular, the optimal production schedule of olefins, aromatics, and other petrochemical products over the specified planning horizon is configured by selecting throughput, operating conditions, and technology options for each unit in the chain, by maintaining the desir

关键词： .demands raw materials suppliers Chem Res distributors Crude oil programming model Planning and Scheduling supply network petroleum supply chain tankers

来源：评论

学校读者我要写书评

暂无评论

programming model for a heterogeneous x86 platform

Programming model for a heterogeneous x86 platform

引用

作者： Saha, Bratin Zhou, Xiaocheng Chen, Hu Gao, Ying Yan, Shoumeng Rajagopalan, Mohan Fang, Jesse Zhang, Peinan Ronen, Ronny Mendelson, Avi Intel Corporation

The client computing platform is moving towards a heterogeneous architecture consisting of a combination of cores focused on scalar performance, and a set of throughput-oriented cores. The throughput oriented cores (e.g. a GPU) may be connected over both coherent and non-coherent interconnects, and have different ISAs. This paper describes a programming model for such heterogeneous platforms. We discuss the language constructs, runtime implementation, and the memory model for such a programming environment. We implemented this programming environment in a x86 heterogeneous platform simulator. We ported a number of workloads to our programming environment, and present the performance of our programming environment on these workloads. Copyright © 2009 ACM.

关键词： Heterogeneous platforms programming model

来源：评论

学校读者我要写书评

暂无评论

The WebSphere Application Server architecture and programming model

引用

IBM SYSTEMS JOURNAL 1998年第3期37卷 336-348页

作者： Bayeh, E IBM Corp Software Solut Div Res Triangle Pk NC 27709 USA

This paper discusses the infrastructure that IBM is providing to support the World Wide Web and to facilitate Web applications and commerce. This effort started as an architecture called the Network Computing Framework (NCF), and is now the foundation of the IBM WebSphere Application Server(TM). The WebSphere Application Server is a product ISM first delivered in June 1998. In this paper we discuss this architecture and programming model. We start with a brief introduction and history of the NCF, then examine the architecture of the WebSphere Application Server. We take a close look at the core run time of the WebSphere Application Server, then delve into the Java(TM) programming model that supports this architecture. We also present the reasons why Java is a prominent part of this architecture, and see what relevant technologies Java provides for this run time.

关键词： .servlets programming model Web servers

来源：评论

学校读者我要写书评

暂无评论

Towards a programming model for context-aware applications

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2012年第3期38卷 199-213页

作者： Barbosa, Jorge Dillenburg, Fabiane Lerrnen, Gustavo Garzao, Alex Costa, Cristiano Rosa, Joao Univ Sinos Valley Unisinos Interdisciplinary Postgrad Program Appl Comp Sci PIPCA BR-93022000 Sao Leopoldo RS Brazil

In mobile computing scenarios, users move in different environments and applications can automatically explore their surroundings. This type of context-aware application is an emerging trend, so far not widely disseminated. We believe that the proposal of a programming model specifically designed for the specification of context-aware applications, using general abstractions, will foster a rapidly widespread of such kind of software. In this article, we propose the use of the Holoparadigm (in short Holo) to fill this gap. We created a programming language based on Holo (called HoloL) to demonstrate the strengths of Holoparadigm to develop context-aware applications. The article uses a sample scenario to show the Holo's practical aspects related to implementation of context-aware applications. We also present a platform to HoloL (called HoloEnv), composed of a compiler, a virtual machine, and a distributed execution environment. Finally, different performance aspects of the HoloEnv's components were evaluated through experimental results. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Mobile computing Context-aware computing programming model

来源：评论

学校读者我要写书评

暂无评论

A programming model for Hybrid Collaborative Adaptive Systems

引用

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING 2020年第1期8卷 6-19页

作者： Scekic, Ognjen Schiavinotto, Tommaso Videnov, Svetoslav Rovatsos, Michael Hong-Linh Truong Miorandi, Daniele Dustdar, Schahram TU Wien Distributed Syst Grp A-1040 Vienna Austria U Hopper I-38121 Trento Italy Univ Edinburgh Ctr Intelligent Syst & Their Applicat Edinburgh EH8 9YL Midlothian Scotland

Hybrid Diversity-aware Collective Adaptive Systems (HDA-CAS) are a new generation of socio-technical systems where both human and machine peers collectively participate in complex cognitive and physical tasks. These systems are characterized by the fundamental properties of hybridity and collectiveness, hiding from users the complexities associated with managing the collaboration and coordination of human-machine teams. The SmartSociety platform is a set of integrated software components that jointly provide a number of advanced HDA-CAS functionalities. As part of the CAS initiative, we have developed a programming model and Java APIs that make the use of those functionalities easy and accessible to application developers. In this paper we present the SmartSociety programming model elements, including the principal contributions - Collectives and Collective-based Tasks. We describe and discuss their functionality, implementation and runtime environment. Finally, we qualitatively evaluate the programming model and the language constructs with respect to the desired HDA-CAS properties.

关键词： programming Collaboration Computational modeling Software Adaptation models Adaptive systems Context Socio-technical systems collective adaptive systems crowdsourcing social computing programming model

来源：评论

学校读者我要写书评

暂无评论

INKS: a programming model to decouple algorithm from optimization in HPC codes

引用

JOURNAL OF SUPERCOMPUTING 2020年第6期76卷 4666-4681页

作者： Ejjaaouani, Ksander Aumage, Olivier Bigot, Julien Mehrenberger, Michel Murai, Hitoshi Nakao, Masahiro Sato, Mitsuhisa Univ Paris Saclay Maison Simulat CEA CNRSUniv Paris SudUVSQInria Gif Sur Yvette France INRIA LaBri Bordeaux France Univ Paris Saclay Maison Simulat CEA CNRSUniv Paris SudUVSQ Gif Sur Yvette France Univ Marseille Marseille France Riken CCS Kobe Hyogo Japan

Existing programming models tend to tightly interleave algorithm and optimization in HPC simulation codes. This requires scientists to become experts in both the simulated domain and the optimization process and makes the code difficult to maintain or port to new architectures. In this paper, we propose the INKS programming model that decouples these concerns with two distinct languages: INKSpia to express the simulation algorithm and INKSpso for optimizations. We define INKS (pia) and evaluate the feasibility of defining INKSpso with three test languages: INKSo/C++, INKSo/loop and INKSo/XMP. We evaluate the approach on synthetic benchmarks (NAS and heat equation) as well as on a more complex example (6D Vlasov-Poisson solver). Our evaluation demonstrates the soundness of the approach as it improves the separation of algorithmic and optimization concerns at no performance cost. We also identify a set of guidelines for the later full definition of the INKSpso language.

关键词： programming model Separation of concerns HPC DSL

来源：评论

学校读者我要写书评

暂无评论

Satin: A High-Level and Efficient Grid programming model

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2010年第3期32卷 9-9.39页

作者： Van Nieuwpoort, Rob V. Wrzesinska, Gosia Jacobs, Ceriel J. H. Bal, Henri E. Vrije Univ Amsterdam Fac Exacte Wetenschappen NL-1081 HV Amsterdam Netherlands Pointl Dev NL-3001 GC Rotterdam Netherlands

Computational grids have an enormous potential to provide compute power. However, this power remains largely unexploited today for most applications, except trivially parallel programs. Developing parallel grid applications simply is too difficult. Grids introduce several problems not encountered before, mainly due to the highly heterogeneous and dynamic computing and networking environment. Furthermore, failures occur frequently, and resources may be claimed by higher-priority jobs at any time. In this article, we solve these problems for an important class of applications: divide-and-conquer. We introduce a system called Satin that simplifies the development of parallel grid applications by providing a rich high-level programming model that completely hides communication. All grid issues are transparently handled in the runtime system, not by the programmer. Satin's programming model is based on Java, features spawn-sync primitives and shared objects, and uses asynchronous exceptions and an abort mechanism to support speculative parallelism. To allow an efficient implementation, Satin consistently exploits the idea that grids are hierarchically structured. Dynamic load-balancing is done with a novel cluster-aware scheduling algorithm that hides the long wide-area latencies by overlapping them with useful local work. Satin's shared object model lets the application define the consistency model it needs. If an application needs only loose consistency, it does not have to pay high performance penalties for wide-area communication and synchronization. We demonstrate how grid problems such as resource changes and failures can be handled transparently and efficiently. Finally, we show that adaptivity is important in grids. Satin can increase performance considerably by adding and removing compute resources automatically, based on the application's requirements and the utilization of the machines and networks in the grid. Using an extensive evaluation on real grids with

关键词： Languages Performance Grid computing divide-and-conquer programming model

来源：评论

学校读者我要写书评

暂无评论

A programming model performance study using the NAS parallel benchmarks

引用

SCIENTIFIC programming 2010年第3-4期18卷 153-167页

作者： Shan, Hongzhang Blagojevic, Filip Min, Seung-Jai Hargrove, Paul Jin, Haoqiang Fuerlinger, Karl Koniges, Alice Wright, Nicholas J. Univ Calif Berkeley Lawrence Berkeley Lab Computat Res Div Future Technol Grp Berkeley CA 94720 USA NASA Ames Res Ctr NAS Div Moffett Field CA 94035 USA Univ Calif Berkeley Dept EECS Div Comp Sci Berkeley CA 94720 USA Univ Calif Berkeley Lawrence Berkeley Lab NERSC Berkeley CA 94720 USA

Harnessing the power of multicore platforms is challenging due to the additional levels of parallelism present. In this paper we use the NAS Parallel Benchmarks to study three programming models, MPI, OpenMP and PGAS to understand their performance and memory usage characteristics on current multicore architectures. To understand these characteristics we use the Integrated Performance Monitoring tool and other ways to measure communication versus computation time, as well as the fraction of the run time spent in OpenMP. The benchmarks are run on two different Cray XT5 systems and an Infiniband cluster. Our results show that in general the three programming models exhibit very similar performance characteristics. In a few cases, OpenMP is significantly faster because it explicitly avoids communication. For these particular cases, we were able to re-write the UPC versions and achieve equal performance to OpenMP. Using OpenMP was also the most advantageous in terms of memory usage. Also we compare performance differences between the two Cray systems, which have quad-core and hex-core processors. We show that at scale the performance is almost always slower on the hex-core system because of increased contention for network resources.

关键词： programming model performance study UPC OpenMP MPI memory usage

来源：评论

学校读者我要写书评

暂无评论

A domain-specific high-level programming model

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2016年第3期28卷 750-767页

作者： Mansouri, Farouk Huet, Sylvain Houzet, Dominque Gipsa Lab 11 Rue MathGrenoble Campus BP46 F-38402 St Martin Dheres France

Nowadays, computing hardware continues to move toward more parallelism and more heterogeneity, to obtain more computing power. From personal computers to supercomputers, we can find several levels of parallelism expressed by the interconnections of multi-core and many-core accelerators. On the other hand, computing software needs to adapt to this trend, and programmers can use parallel programming models (PPM) to fulfil this difficult task. There are different PPMs available that are based on tasks, directives, or low-level languages or library. These offer higher or lower abstraction levels from the architecture by handling their own syntax. However, to offer an efficient PPM with a greater (additional) high-level abstraction level while saving on performance, one idea is to restrict this to a specific domain and to adapt it to a family of applications. In the present study, we propose a high-level PPM specific to digital signal-processing applications. It is based on data-flow graph models of computation, and a dynamic run-time model of execution (StarPU). We show how the user can easily express this digital signal-processing application and can take advantage of task, data, and graph parallelism in the implementation, to enhance the performances of targeted heterogeneous clusters composed of CPUs and different accelerators (e.g., GPU and Xeon Phi). Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： programming model heterogeneous cluster data-flow graph digital signal processing unfolding techniques auto-tuning

来源：评论

学校读者我要写书评

暂无评论

Water allocation for agriculture in southwestern Iran using a programming model

引用

APPLIED WATER SCIENCE 2015年第3期5卷 305-310页

作者： Esmaeili, Abdoulkarim Shahsavari, Zahra Shiraz Univ Coll Agr Dept Agr Econ Shiraz Iran

Water pricing can play a major role in improving water allocation, encouraging users to conserve scarce water resources, and promoting improvements in productivity. In this study, the economic values of water in farms under Dorodzan Dam in southwestern Iran were calculated using linear programming models. The method was applied to three samples of farms that drew irrigation water from a canal, a well, and both a well and a canal. The results of this study revealed that the shadow prices of water in farms varied based on the water sources and time of year. Additionally, the estimated price for water is obviously higher than the price that farmers currently pay for water in the study area. Due to the different economic values of water calculated for different months, it is recommended that the price of irrigation water be adjusted accordingly during various seasons in a fashion similar to that of electrical energy.

关键词： Water pricing Water allocation programming model Southwestern Iran

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：