A Thread Performance Comparison: Windows NT and Solaris on a Symmetric Multiprocessor

Total Page:16

File Type:pdf, Size:1020Kb

A Thread Performance Comparison: Windows NT and Solaris on a Symmetric Multiprocessor The following paper was originally published in the Proceedings of the 2nd USENIX Windows NT Symposium Seattle, Washington, August 3–4, 1998 A Thread Performance Comparison: Windows NT and Solaris on A Symmetric Multiprocessor Fabian Zabatta and Kevin Ying Brooklyn College and CUNY Graduate School For more information about USENIX Association contact: 1. Phone: 510 528-8649 2. FAX: 510 548-5738 3. Email: [email protected] 4. WWW URL:http://www.usenix.org/ A Thread Performance Comparison: Windows NT and Solaris on A Symmetric Multiprocessor Fabian Zabatta and Kevin Ying Logic Based Systems Lab Brooklyn College and CUNY Graduate School Computer Science Department 2900 Bedford Avenue Brooklyn, New York 11210 {fabian, kevin}@sci.brooklyn.cuny.edu Abstract Manufacturers now have the capability to build high performance multiprocessor machines with common CPU CPU CPU CPU cache cache cache cache PC components. This has created a new market of low cost multiprocessor machines. However, these machines are handicapped unless they have an oper- Bus ating system that can take advantage of their under- lying architectures. Presented is a comparison of Shared Memory I/O two such operating systems, Windows NT and So- laris. By focusing on their implementation of Figure 1: A basic symmetric multiprocessor architecture. threads, we show each system's ability to exploit multiprocessors. We report our results and inter- pretations of several experiments that were used to compare the performance of each system. What 1.1 Symmetric Multiprocessing emerges is a discussion on the performance impact of each implementation and its significance on vari- Symmetric multiprocessing (SMP) is the primary ous types of applications. parallel architecture employed in these low cost ma- chines. An SMP architecture is a tightly coupled multiprocessor system, where processors share a 1. Introduction single copy of the operating system (OS) and re- sources that often include a common bus, memory A few years ago, high performance multiprocessor and an I/O system, see Figure 1. However, the ma- machines had a price tag of $100,000 and up, see chine is handicapped unless it has an OS that is able [16]. The multiprocessor market consisted of pro- to take advantage of its multiprocessors. In the past, prietary architectures that demanded a higher cost the manufacturer of a multiprocessor machine would due to the scale of economics. Intel has helped to be responsible for the design and implementation of change that by bringing high performance comput- the machine's OS. It was often the case, the ma- ing to the mainstream with its Pentium Pro (PPro) chines could only operate under the OS provided by processor. The PPro is a high performance processor the manufacturer. The machines described here are with built in support for multiprocessing, see [4]. built from common PC components and have open This coupled with the low cost of components has architectures. This facilitates an environment where enabled computer manufacturers to build high per- any software developer can design and implement an formance multiprocessor machines at a relatively OS for these machines. Two mainstream examples low cost. Today a four processor machine costs un- of such operating systems are Sun's Solaris and Mi- der $12,000. crosoft's Windows NT. They exploit the power of multiprocessors by incorporating multitasking and multithreading architectures. Their implementations design arises from sharing the same address space. are nevertheless very different. This allows sub-objects of the same process to easily communicate by using shared global variables. However, the sharing of data requires synchroniza- 1.2 Objects Of Execution tion to prevent simultaneous access. This is usually accomplished by using one of the synchronization Classic operating systems, such as UNIX, define a variables provided by the OS, such as a mutex. For process as an object of execution that consists of an general background information on synchronization address space, program counter, stack, data, files, variables see [14], for information on Solaris's syn- and other system resources. Processes are individu- chronization variables see [1, 5, 12, 13], and [7, 10, ally dispatched and scheduled to execute on a proc- 15] for Windows NT's synchronization variables. essor by the operating system kernel, the essential part of the operating system responsible for manag- ing hardware and basic services. In the classic case, 2. Solaris’s and Windows NT’s Design a multitasking operating system divides the available CPU time among the processes of the system. While Windows NT and Solaris further develop the basic executing, a process has only one unit of control. design by sub-dividing the kernel-level objects of Thus, the process can only perform one task at a execution into smaller user-level objects of execu- time. tion. These user-level objects are unknown to the operating system kernel and thus are not executable In order to exploit concurrency and parallelism, op- on their own. They are usually scheduled by the erating systems like NT and Solaris further develop application programmer or a system library to exe- the notion of a process. These operating systems cute in the context of a kernel-level object of execu- break the classical process into smaller sub-objects. tion. These sub-objects are the basic entity to which the OS allocates processor time. Here we will refer them Windows NT and Solaris kernel-level objects of exe- as kernel-level objects of execution. Current oper- cution are similar in several ways. Both operating ating systems allow processes to contain one or more systems use a priority-based, time-sliced, preemptive of these sub-objects. Each sub-object has its own multitasking algorithm to schedule their kernel-level context1 yet it shares the same address space and objects. Each kernel-level object may be either in- resources, such as open files, timers and signals, terleaved on a single processor or execute in parallel with other sub-objects of the same process. The de- on multiprocessors. However, the two operating sign lets the sub-objects function independently systems differ on whether user-level or kernel-level while keeping cohesion among the sub-objects of the objects should be used for parallel and concurrent same process. This creates the following benefits. programming. The differences have implications on the overall systems' performances, as we will see in Since each sub-object has its own context each can later sections. be separately dispatched and scheduled by the oper- ating system kernel to execute on a processor. Therefore, a process in one of these operating sys- 2.1 NT’s Threads and Fibers tems can have one or more units of control. This enables a process with multiple sub-objects to over- A thread is Windows NT’s smallest kernel-level lap processing. For example, one sub-object could object of execution. Processes in NT can consist of continue execution while another is blocked by an one or more threads. When a process is created, one I/O request or synchronization lock. This will im- thread is generated along with it, called the primary prove throughput. Furthermore with a multiproces- thread. This object is then scheduled on a system sor machine, a process can have sub-objects execute wide basis by the kernel to execute on a processor. concurrently on different processors. Thus, a com- After the primary thread has started, it can create putation can be made parallel to achieve speed-up other threads that share its address space and system over its serial counterpart. Another benefit of the resources but have independent contexts, which in- clude execution stacks and thread specific data. A thread can execute any part of a process' code, in- 1 This refers to its state, defined by the values of the program counter, cluding a part currently being executed by another machine registers, stacks, and other data. thread. It is through threads, provided in the Win32 automatically. One or more threads can be mapped application programmer interface (API), that Win- to a light weight process. The mapping is deter- dows NT allows programmers to exploit the benefits mined by the library or the application programmer. of concurrency and parallelism. Since the threads execute in the context of a light A fiber is NT’s smallest user-level object of execu- weight process, the operating system kernel is un- tion. It executes in the context of a thread and is aware of their existence. The kernel is only aware of unknown to the operating system kernel. A thread the LWPs that threads execute on. An illustrative can consist of one or more fibers as determined by example of this design is shown in Figure 3. the application programmer. ˝Some literature ˝[1,11] assume that there is a one-to-one mapping of user- level objects to kernel-level objects, this is inaccu- Thread Library rate. Windows NT does ˝provide the means for Threads many-to-many ˝scheduling. However, NT's design is Application code, global data, ect. poorly documented and the application programmer Scheduler is responsible for the control of fibers such as allo- LWPs cating memory, scheduling them on threads and pre- emption. This is different from Solaris's implemen- Process Structure tation, as we shall see in the next section. See [7, 10] for more details on fibers. An illustrative exam- The Solaris Kernel ple of NT's design is shown in Figure 2. Figure 3: The relationships of a process and its LWPs and threads Fibers in Solaris. Application Code Global Data Solaris's thread library defines two types of threads Threads according to scheduling. A bound thread is one that permanently executes in the context of a light weight process in which no other threads can execute.
Recommended publications
  • Designing an Ultra Low-Overhead Multithreading Runtime for Nim
    Designing an ultra low-overhead multithreading runtime for Nim Mamy Ratsimbazafy Weave [email protected] https://github.com/mratsim/weave Hello! I am Mamy Ratsimbazafy During the day blockchain/Ethereum 2 developer (in Nim) During the night, deep learning and numerical computing developer (in Nim) and data scientist (in Python) You can contact me at [email protected] Github: mratsim Twitter: m_ratsim 2 Where did this talk came from? ◇ 3 years ago: started writing a tensor library in Nim. ◇ 2 threading APIs at the time: OpenMP and simple threadpool ◇ 1 year ago: complete refactoring of the internals 3 Agenda ◇ Understanding the design space ◇ Hardware and software multithreading: definitions and use-cases ◇ Parallel APIs ◇ Sources of overhead and runtime design ◇ Minimum viable runtime plan in a weekend 4 Understanding the 1 design space Concurrency vs parallelism, latency vs throughput Cooperative vs preemptive, IO vs CPU 5 Parallelism is not 6 concurrency Kernel threading 7 models 1:1 Threading 1 application thread -> 1 hardware thread N:1 Threading N application threads -> 1 hardware thread M:N Threading M application threads -> N hardware threads The same distinctions can be done at a multithreaded language or multithreading runtime level. 8 The problem How to schedule M tasks on N hardware threads? Latency vs 9 Throughput - Do we want to do all the work in a minimal amount of time? - Numerical computing - Machine learning - ... - Do we want to be fair? - Clients-server - Video decoding - ... Cooperative vs 10 Preemptive Cooperative multithreading:
    [Show full text]
  • Fiber Context As a first-Class Object
    Document number: P0876R6 Date: 2019-06-17 Author: Oliver Kowalke ([email protected]) Nat Goodspeed ([email protected]) Audience: SG1 fiber_context - fibers without scheduler Revision History . .1 abstract . .2 control transfer mechanism . .2 std::fiber_context as a first-class object . .3 encapsulating the stack . .4 invalidation at resumption . .4 problem: avoiding non-const global variables and undefined behaviour . .5 solution: avoiding non-const global variables and undefined behaviour . .6 inject function into suspended fiber . 11 passing data between fibers . 12 termination . 13 exceptions . 16 std::fiber_context as building block for higher-level frameworks . 16 interaction with STL algorithms . 18 possible implementation strategies . 19 fiber switch on architectures with register window . 20 how fast is a fiber switch . 20 interaction with accelerators . 20 multi-threading environment . 21 acknowledgments . 21 API ................................................................ 22 33.7 Cooperative User-Mode Threads . 22 33.7.1 General . 22 33.7.2 Empty vs. Non-Empty . 22 33.7.3 Explicit Fiber vs. Implicit Fiber . 22 33.7.4 Implicit Top-Level Function . 22 33.7.5 Header <experimental/fiber_context> synopsis . 23 33.7.6 Class fiber_context . 23 33.7.7 Function unwind_fiber() . 27 references . 29 Revision History This document supersedes P0876R5. Changes since P0876R5: • std::unwind_exception removed: stack unwinding must be performed by platform facilities. • fiber_context::can_resume_from_any_thread() renamed to can_resume_from_this_thread(). • fiber_context::valid() renamed to empty() with inverted sense. • Material has been added concerning the top-level wrapper logic governing each fiber. The change to unwinding fiber stacks using an anonymous foreign exception not catchable by C++ try / catch blocks is in response to deep discussions in Kona 2019 of the surprisingly numerous problems surfaced by using an ordinary C++ exception for that purpose.
    [Show full text]
  • Fiber-Based Architecture for NFV Cloud Databases
    Fiber-based Architecture for NFV Cloud Databases Vaidas Gasiunas, David Dominguez-Sal, Ralph Acker, Aharon Avitzur, Ilan Bronshtein, Rushan Chen, Eli Ginot, Norbert Martinez-Bazan, Michael Muller,¨ Alexander Nozdrin, Weijie Ou, Nir Pachter, Dima Sivov, Eliezer Levy Huawei Technologies, Gauss Database Labs, European Research Institute fvaidas.gasiunas,david.dominguez1,fi[email protected] ABSTRACT to a specific workload, as well as to change this alloca- The telco industry is gradually shifting from using mono- tion on demand. Elasticity is especially attractive to op- lithic software packages deployed on custom hardware to erators who are very conscious about Total Cost of Own- using modular virtualized software functions deployed on ership (TCO). NFV meets databases (DBs) in more than cloudified data centers using commodity hardware. This a single aspect [20, 30]. First, the NFV concepts of modu- transformation is referred to as Network Function Virtual- lar software functions accelerate the separation of function ization (NFV). The scalability of the databases (DBs) un- (business logic) and state (data) in the design and imple- derlying the virtual network functions is the cornerstone for mentation of network functions (NFs). This in turn enables reaping the benefits from the NFV transformation. This independent scalability of the DB component, and under- paper presents an industrial experience of applying shared- lines its importance in providing elastic state repositories nothing techniques in order to achieve the scalability of a DB for various NFs. In principle, the NFV-ready DBs that are in an NFV setup. The special combination of requirements relevant to our discussion are sophisticated main-memory in NFV DBs are not easily met with conventional execution key-value (KV) stores with stringent high availability (HA) models.
    [Show full text]
  • Concurrent Cilk: Lazy Promotion from Tasks to Threads in C/C++
    Concurrent Cilk: Lazy Promotion from Tasks to Threads in C/C++ Christopher S. Zakian, Timothy A. K. Zakian Abhishek Kulkarni, Buddhika Chamith, and Ryan R. Newton Indiana University - Bloomington, fczakian, tzakian, adkulkar, budkahaw, [email protected] Abstract. Library and language support for scheduling non-blocking tasks has greatly improved, as have lightweight (user) threading packages. How- ever, there is a significant gap between the two developments. In previous work|and in today's software packages|lightweight thread creation incurs much larger overheads than tasking libraries, even on tasks that end up never blocking. This limitation can be removed. To that end, we describe an extension to the Intel Cilk Plus runtime system, Concurrent Cilk, where tasks are lazily promoted to threads. Concurrent Cilk removes the overhead of thread creation on threads which end up calling no blocking operations, and is the first system to do so for C/C++ with legacy support (standard calling conventions and stack representations). We demonstrate that Concurrent Cilk adds negligible overhead to existing Cilk programs, while its promoted threads remain more efficient than OS threads in terms of context-switch overhead and blocking communication. Further, it enables development of blocking data structures that create non-fork-join dependence graphs|which can expose more parallelism, and better supports data-driven computations waiting on results from remote devices. 1 Introduction Both task-parallelism [1, 11, 13, 15] and lightweight threading [20] libraries have become popular for different kinds of applications. The key difference between a task and a thread is that threads may block|for example when performing IO|and then resume again.
    [Show full text]
  • The Impact of Process Placement and Oversubscription on Application Performance: a Case Study for Exascale Computing
    Takustraße 7 Konrad-Zuse-Zentrum D-14195 Berlin-Dahlem fur¨ Informationstechnik Berlin Germany FLORIAN WENDE,THOMAS STEINKE,ALEXANDER REINEFELD The Impact of Process Placement and Oversubscription on Application Performance: A Case Study for Exascale Computing ZIB-Report 15-05 (January 2015) Herausgegeben vom Konrad-Zuse-Zentrum fur¨ Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Telefon: 030-84185-0 Telefax: 030-84185-125 e-mail: [email protected] URL: http://www.zib.de ZIB-Report (Print) ISSN 1438-0064 ZIB-Report (Internet) ISSN 2192-7782 The Impact of Process Placement and Oversubscription on Application Performance: A Case Study for Exascale Computing Florian Wende, Thomas Steinke, Alexander Reinefeld Abstract: With the growing number of hardware components and the increasing software complexity in the upcoming exascale computers, system failures will become the norm rather than an exception for long-running applications. Fault-tolerance can be achieved by the creation of checkpoints dur- ing the execution of a parallel program. Checkpoint/Restart (C/R) mechanisms allow for both task migration (even if there were no hardware faults) and restarting of tasks after the occurrence of hard- ware faults. Affected tasks are then migrated to other nodes which may result in unfortunate process placement and/or oversubscription of compute resources. In this paper we analyze the impact of unfortunate process placement and oversubscription of compute resources on the performance and scalability of two typical HPC application workloads, CP2K and MOM5. Results are given for a Cray XC30/40 with Aries dragonfly topology. Our results indicate that unfortunate process placement has only little negative impact while oversubscription substantially degrades the performance.
    [Show full text]
  • And Computer Systems I: Introduction Systems
    Welcome to Computer Team! Noah Singer Introduction Welcome to Computer Team! Units Computer and Computer Systems I: Introduction Systems Computer Parts Noah Singer Montgomery Blair High School Computer Team September 14, 2017 Overview Welcome to Computer Team! Noah Singer Introduction 1 Introduction Units Computer Systems 2 Units Computer Parts 3 Computer Systems 4 Computer Parts Welcome to Computer Team! Noah Singer Introduction Units Computer Systems Computer Parts Section 1: Introduction Computer Team Welcome to Computer Team! Computer Team is... Noah Singer A place to hang out and eat lunch every Thursday Introduction A cool discussion group for computer science Units Computer An award-winning competition programming group Systems A place for people to learn from each other Computer Parts Open to people of all experience levels Computer Team isn’t... A programming club A highly competitive environment A rigorous course that requires commitment Structure Welcome to Computer Team! Noah Singer Introduction Units Four units, each with five to ten lectures Computer Each lecture comes with notes that you can take home! Systems Computer Guided activities to help you understand more Parts difficult/technical concepts Special presentations and guest lectures on interesting topics Conventions Welcome to Computer Team! Noah Singer Vocabulary terms are marked in bold. Introduction Definition Units Computer Definitions are in boxes (along with theorems, etc.). Systems Computer Parts Important statements are highlighted in italics. Formulas are written
    [Show full text]
  • Enabling Technologies for Distributed and Cloud Computing Dr
    Enabling Technologies for Distributed and Cloud Computing Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF Technologies for Network-Based Systems Multi-core CPUs and Multithreading Technologies CPU’s today assume a multi-core architecture with dual, quad, six, or more processing cores. The clock rate increased from 10 MHz for Intel 286 to 4 GHz for Pentium 4 in 30 years. However, the clock rate reached its limit on CMOS chips due to power limitations. Clock speeds cannot continue to increase due to excessive heat generation and current leakage. Multi-core CPUs can handle multiple instruction threads. Technologies for Network-Based Systems Multi-core CPUs and Multithreading Technologies LI cache is private to each core, L2 cache is shared and L3 cache or DRAM is off the chip. Examples of multi-core CPUs include Intel i7, Xeon, AMD Opteron. Each core can also be multithreaded. E.g. the Niagara II has 8 cores with each core handling 8 threads for a total of 64 threads maximum. Technologies for Network-Based Systems Hyper-threading (HT) Technology A feature of certain Intel chips (such as Xeon, i7) that makes one physical core appear as two logical processors. On an operating system level, a single-core CPU with Hyper- Threading technology will be reported as two logical processors, dual-core CPU with HT is reported as four logical processors, and so on. HT adds a second set of general, control and special registers. The second set of registers allows the CPU to keep the state of both cores, and effortlessly switch between them by switching the register set.
    [Show full text]
  • Eindhoven University of Technology MASTER Acceleration of A
    Eindhoven University of Technology MASTER Acceleration of a geodesic fiber-tracking algorithm for diffusion tensor imaging using CUDA van Aart, E. Award date: 2010 Link to publication Disclaimer This document contains a student thesis (bachelor's or master's), as authored by a student at Eindhoven University of Technology. Student theses are made available in the TU/e repository upon obtaining the required degree. The grade received is not published on the document as presented in the repository. The required complexity or quality of research of student theses may vary by program, and the required minimum study period may vary in duration. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain Acceleration of a Geodesic Fiber-Tracking Algorithm for Diffusion Tensor Imaging using CUDA Evert van Aart June 2010 Graduation Supervisor Dr. Andrei Jalba Eindhoven University of Technology Department of Mathematics and Computer Science Visualization group Committee Members Dr. Andrei Jalba Dr. Anna Vilanova Eindhoven University of Technology Department of Biomedical Engineering Biomedical Image Analysis group Dr. Bart Mesman Eindhoven University of Technology Department of Electrical Engineering Electronic Systems group Contents 1 Introduction 3 1.1 Problem Description .
    [Show full text]
  • HPX-Agseries
    Digital Fiber-Optic Sensors Easy operation and high performance for a variety of applications HPX-AG Series Dual display shows incoming light level and preset value side by side. High sensitivity and ultra long distance (1,200mm with the standard HPF-T003 thru scan fiber in high power mode) Three types of auto-tuning: 2-point, BGS and % EXPLANATION OF MAJOR FUNCTIONS AND FEATURES Easy-to-use design Auto-tuning button Function selection button Dual display panel Preset value Incoming light level The digital dual display panel indicates incoming light level and preset value side by side, so it is easy to check current scanning status while setting the sensor. The button layout is especially designed to ensure easy operation of gang-mounted sensors. Output indicator +Button -Button Easy operation Digital manual tuning With controls that are as easy to operate as a conventional potentiometer, and with easy-to-read digital display, settings can be changed directly in RUN mode. Less wiring, fewer man-hours The new models offer a choice between cable lead-out, M8 connector for fast installation, and reduced wiring models that receive power directly from adjacent gang-mounted units. Up to 16 units can be gang-mounted, with only the main unit wired to the power supply. M8 connector type Reduced wiring type Units are designed so that connecting cable is not required. There are no worries about wiring mishaps when mounting or dismounting. NEW Wiring with an M8 connector cable Add 1 sensor— save 2 wires! Up to 16 units can be combined. Since power is supplied through the gang-mounting connectors, only an output wire is required for the expansion units.
    [Show full text]
  • Fibers Are Not (P)Threads the Case for Loose Coupling of Asynchronous Programming Models and MPI Through Continuations
    Fibers are not (P)Threads The Case for Loose Coupling of Asynchronous Programming Models and MPI Through Continuations Joseph Schuchart Christoph Niethammer José Gracia [email protected] [email protected] [email protected] Höchstleistungsrechenzentrum Höchstleistungsrechenzentrum Höchstleistungsrechenzentrum Stuttgart (HLRS) Stuttgart (HLRS) Stuttgart (HLRS) Stuttgart, Germany Stuttgart, Germany Stuttgart, Germany ABSTRACT multi- and many-core systems by exposing all available concur- Asynchronous programming models (APM) are gaining more and rency to a runtime system. Applications are expressed in terms of more traction, allowing applications to expose the available concur- work-packages (tasks) with well-defined inputs and outputs, which rency to a runtime system tasked with coordinating the execution. guide the runtime scheduler in determining the correct execution While MPI has long provided support for multi-threaded commu- order of tasks. A wide range of task-based programming models nication and non-blocking operations, it falls short of adequately have been developed, ranging from node-local approaches such supporting APMs as correctly and efficiently handling MPI com- as OpenMP [40] and OmpSs [13] to distributed systems such as munication in different models is still a challenge. Meanwhile, new HPX [27], StarPU [3], DASH [49], and PaRSEC [7]. All of them have low-level implementations of light-weight, cooperatively scheduled in common that a set of tasks is scheduled for execution by a set of execution contexts (fibers, aka user-level threads (ULT)) are meant to worker threads based on constraints provided by the user, either in serve as a basis for higher-level APMs and their integration in MPI the form of dependencies or dataflow expressions.
    [Show full text]
  • Use of High Perfo Nce Networks and Supercomputers Ime Flight Simulation
    USE OF HIGH PERFO NCE NETWORKS AND SUPERCOMPUTERS IME FLIGHT SIMULATION Jeff I. Cleveland EE Project Engineer 3 National Aeronautics and Space Ad I Langley Research Center Nampton, Virginia 23681-0001 ABSTRACT In order to meet the stringent time-critical requirements for real-time man-in-the-loop flight simulation, computer processing operations must be consistent in processing time and be completed in as short a time as possible. These operations include simulation mathematical model computation and data inputloutput to the shulators. En 1986, in response to increased demands for flight simulation performance, NASA's Langley Research Center (LaRC), working with the contractor, developed extensions to the Computer Automated Measurement and Control (CAMAC) technology which resulted in a factor of ten increase in the effective bandwidlla and reduced latency of modules necessary for simulator communication. This technology extension is being used by more than 80 leading technological developers in the United States, Canada, and Europe. Included among the commercial applications are nuclear process control, power grid analysis, process monitoring, real-lime simulation, and radar data acquisition. Personnel at LaRC are completing the development of the use of supercomputers for mathematical model computation to support real-time flight simulation. This includes the development of a real-time operating system and development of specialized software and hardwxe for the simulator network. This paper describes the data acquisition technology and the development of supek-eompu~ng for flight simulation. INTRODUCTION NASA's Langley Research Center (LaRC) has used real-time flight simulation to support aerodynmic, space, and hardware research for over forty years.
    [Show full text]
  • Parallel Simulation of a Multi-Span DWDM System Limited by FWM
    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 23 March 2021 doi:10.20944/preprints202103.0558.v1 Article Parallel simulation of a multi-span DWDM system limited by FWM Rafael Sanchez-Lara 1 , Jose Luis Lopez-Martinez 2 , Joel Antonio Trejo-Sanchez 3 ,Herman Leonard Offerhaus 4 and Jose Alfredo Alvarez-Chavez 4* 1 Universidad Autonoma del Carmen (UNACAR), Facultad de Ingenieria, C.56, No. 4, C.P. 24180, Cd. Del Carmen, Campeche, Mexico; [email protected] 2 Facultad de Matematicas, Universidad Autonoma de Yucatan,Merida, Mexico; [email protected] 3 CONACYT-Centro de Investigación en Matemáticas; [email protected] 4 Optical Sciences Group, University of Twente, Enschede, The Netherlands;[email protected]; [email protected] * Correspondence: [email protected] 1 Abstract: One of the non-linear phenomena affecting high bandwidth and long reach communica- 2 tion systems is Four-Wave Mixing (FWM). Unfortunately, the simulation of systems for parameter 3 optimization requires more time as the number of channels increases. In this paper, we propose a 4 new high-performance computational model to obtain the optimal design parameters in a multi- 5 span Dense Wavelength Division Multiplexing (DWDM) system, limited by FWM and the intrinsic 6 Amplified Spontaneous Emission (ASE) noise of optical amplifiers employed in each segment. The 7 simulation in this work provides a complete optical design characterization and compares the effi- 8 ciency and speed improvement of the proposed parallelization model versus an earlier sequential 9 model. Additionally, an analysis of the computational complexity of parallel models is presented, 10 in which two parallel implementations are used; firstly, Open MultiProcessing (OpenMP) which is 11 based on the use of a central multi-core processing unit and secondly, the Compute Unified Device 12 Architecture (CUDA), which is based on the use of a Graphics Processing Unit (GPU).
    [Show full text]