Reservoir characterization techniques have made possible geological reservoir models with multi-million grid blocks populated with permeability, porosity, and fluid saturations. These geological models are often too large to be simulated because of computational limits. These computational limits mean that typical full-field reservoir simulation models are limited to fewer than 1 million cells - at least two orders of magnitude smaller than the geological models. Upscaling techniques have been used to bridge the gap between these geological models and full-field reservoir simulation. Although there have been significant efforts in developing single-phase and two-phase upscaling algorithms, a limited verification of upscaling methods has been performed on a full-field basis. In addition to upscaling techniques, parallel simulation approaches have been developed to solve multi-million cell models with reasonable computational efficiency. Parallel simulations take up to a few hours of CPU time instead of days to run multi- million cell models. However, when many simulations are to be performed over a large range of parameter values for uncertainty studies, parallel simulations again become prohibitive and upscaling must be employed. On the other hand, the results from these upscaled simulations must be validated with results from fine-scale simulations to give confidence on the reliability of the results. There is really no way of knowing how good the results are unless we are able to perform the fine-scale simulations for verification. Parallel ultra-fine-scale simulations may provide the tool for this verification requirement. In this work, we developed several new single-phase upscaling algorithms, and investigated the verification of these techniques applied to a reservoir model and a synthetic model. For complicated multi-phase flow, the single-phase upscaling may lead to large errors. To overcome the inaccuracy, a new relative permeability upscaling approach was investigated in this dissertation research. The new approach was verified by using three-phase, 3D, and highly heterogeneity reservoir model. Based on case studies, the results from the fine-scale model may appropriately be used to guide the upscaling. The parallel simulation may guide engineers to find appropriate upscaled models through a tuning procedure. This tuning procedure has been explored in the current study to obtain results that are in close agreement with the fine-scale simulation results. The combination of parallel simulation technology and upscaling algorithms can be used to provide a better estimation of the amount of uncertainty in predicted oil recovery for real fields. / text

EB teismai ir Komisija tiek praeityje, tiek šiuo metu visus veiksmus, ribojančius paralelinę prekybą, laiko per se pažeidimais. Tokį EB institucijų požiūrio suformavimą paaiškina siekis įgyvendinti svarbiausią EB tikslą – bendrosios rinkos sukūrimą. Tačiau mažėjanti integracinio tikslo reikšmė, sudėtingėjantis šio ir galutinio vartotojo gerbūvio didinimo tikslų santykis, neišvengiamai nulėmė požiūrio į paralelinę prekybą ribojančius veiksmus, keitimąsi. Pirmosios instancijos Teismo sprendimas GlaxoSmithKline byloje buvo pirmasis akivaizdus precedentas naujo požiūrio formavime. Nepaisant teismo konstatavimo, jog paralelinės prekybos ribojimas ne visuomet reiškia, kad yra ir konkurencijos ribojimo tikslas, autoriaus įsitikinimu, teismas galėjo išplėtoti konkurencijos ribojimo sąvoką. Autoriaus nuomone, paralelinės prekybos ribojimo teisinis reglamentavimas turėtų būti keičiamas. Paralelinę prekybą ribojantys veiksmai, atlikti inovaciniuose sektoriuose, neturėtų būti laikomi per se pažeidimu. Tuo tarpu visų kitų veiksmų teisinio reguliavimo keisti nereikėtų. Inovacinius sektorius reikėtų apibrėžti vadovaujantis patiriamų išlaidų tyrimams ir inovacijoms rodikliu, t.y., jeigu 30 procentų viso produkto kainos yra skiriama vystymui ir tyrimams, tokia ūkio šaka laikytina inovatyvia. Padarius išvadą, jog ne visi paralelinę prekybą ribojantys veiksmai turėtų būti laikomi tikslo ribojimais, svarbu išaiškinti konkurencijos ribojimo sąvoką. EB teismų dviprasmiški sprendimai, jog... [toliau žr. visą tekstą] / EU courts and the Commission hold that all agreements which restrict parallel trade are per se infringement. This kind of attitude was formulated subject to the implementation of the ultimate objective of the EU – single market objective. But the receding significance of the single market objective and advanced relationship between the single market objective and the final consumer objective determinated the change of this attitude. The decision of the First Instance Court in GlaxoSmithKline case was the first and evident precedent in formulation of the new attitude. Despite the court’s statement that not all the agreements which restrict parallel trade have as their object the restriction of competition, in the author’s point of view the court might have explicated the concept of the restriction of competition. The author considers that the attitude to the restrictions of parallel trade should be changed. The agreements restricting parallel trade in the innovative sectors should not be regarded as per se infringements. Whereas the agreements restricting parallel trade which are not concluded in the innovative sector should be regarded as per se infringements. The innovative sectors should be determined subject to the rate of the expenses which the undertaking sustains to make innovative decisions. For instance if the expenses for research and development are 30 or even more percent of the total product, the sector might be determined as innovative. Besides these conclusions... [to full text]

No description available.

Thesis (Ph.D.)--University of Wyoming, 2008. / Title from PDF title page (viewed on June 27, 2009). Includes bibliographical references (p. 95-100).

This work presents an automatic cost-analysis system for an implicitly parallel skeletal programming language. Although deducing interesting dynamic characteristics of parallel programs (and in particular, run time) is well known to be an intractable problem in the general case, it can be alleviated by placing restrictions upon the programs which can be expressed. By combining two research threads, the “skeletal” and “shapely” paradigms which take this route, we produce a completely automated, computation and communication sensitive cost analysis system. This builds on earlier work in the area by quantifying communication as well as computation costs, with the former being derived for the Bulk Synchronous Parallel (BSP) model. We present details of our shapely skeletal language and its BSP implementation strategy together with an account of the analysis mechanism by which program behaviour information (such as shape and cost) is statically deduced. This information can be used at compile-time to optimise a BSP implementation and to analyse computation and communication costs. The analysis has been implemented in Haskell. We consider different algorithms expressed in our language for some example problems and illustrate each BSP implementation, contrasting the analysis of their efficiency by traditional, intuitive methods with that achieved by our cost calculator. The accuracy of cost predictions by our cost calculator against the run time of real parallel programs is tested experimentally. Previous shape-based cost analysis required all elements of a vector (our nestable bulk data structure) to have the same shape. We partially relax this strict requirement on data structure regularity by introducing new shape expressions in our analysis framework. We demonstrate that this allows us to achieve the first automated analysis of a complete derivation, the well known maximum segment sum algorithm of Skillicorn and Cai.

(Uncorrected OCR) Abstract of Thesis entitled 'Virtual Links for Multicomputers' Submitted by Siu Kit Wai for the degree of Master of Philosophy at Univsersity of Hong Kong in October 1996 In order to increase computation power, multiple autonomous computers or processors are connected to form a multicomputer. The performance boost is the result of exploiting in parallel the processing power available in individual processors. Parallel processing, however, requires the cooperation among the processors, which implies interprocessor communication. The efficiency of such communications is limited by the bandwidth and number of communication channels between directly connected processors. Multiple processes on a processor share a few hardware communication links/channels to communication with processes executing on a different processor. Effective and efficient sharing of channels is important for the overall system performance; hence it is important that the sharing be properly managed. When the sharing is not provided by the hardware, it can be provided in software at system level. Without a managing component, processes need to be programmed to flight for and gain exclusive access to the communication links. This is usually not effective, error-prone, and could reduce the overall performance of processes executing in the processor. Flexibility is a main advantage of providing a channel-sharing mechanism at system level. Parameters such as packet size, and configuration of the system can be customized and tuned to meet the communication characteristics of different applications. In this project, we investigate how link sharing can be provided at system level. Our approach is based on idea of virtual links. The system is designed to be as transparent and easy to be used as possible. We will discuss how different parameters and configurations affect the system functionality and performance. We also compare this software solution to other existing solutions including a hardware solution. ii / abstract / toc / Computer Science / Master / Master of Philosophy

Thesis (B.A.)--Haverford College, Dept. of Computer Science, 2003. / Includes bibliographical references.

Thesis (M. Sc.)--York University, 1998. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 43-46). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL:http://wwwlib.umi.com/cr/yorku/fullcit?pMQ27394.

No description available.

No description available.