Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nodes”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,315 records · Page 73

System and method for efficient pointer chasing

Described is a system and method for efficient pointer chasing in systems having a single memory node or a network of memory nodes. In particular, a pointer chasing command is sent along with a memory request by an issuing node to a memory node. The pointer chasing command indicates the number of interdependent memory accesses and information needed for the identified interdependent memory accesses. An address computing unit associated with the memory node determines the relevant memory address for an interdependent memory access absent further interaction with the issuing node or without having to return to the issuing node.

Aguilera Diez, Paula↗

Network-aware cache coherence protocol enhancement

A non-uniform memory access system includes several nodes that each have one or more processors, caches, local main memory, and a local bus that connects a node's processor(s) to its memory. The nodes are coupled to one another over a collection of point-to-point interconnects, thereby permitting processors in one node to access data stored in another node. Memory access time for remote memory takes longer than local memory because remote memory accesses have to travel across a communications network to arrive at the requesting processor. In some embodiments, inter-cache and main-memory-to-cache latencies are measured to determine whether it would be more efficient to satisfy memory access requests using cached copies stored in caches of owning nodes or from main memory of home nodes.

Roberts, David A.↗

Smart memory buffers

An example method involves receiving, at a first memory node, data to be written at a memory location in the first memory node. The data is received from a device. At the first memory node, old data is read from the memory location, without sending the old data to the device. The data is written to the memory location. The data and the old data are sent from the first memory node to a second memory node to store parity information in the second memory node without the device determining the parity information. The parity information is based on the data stored in the first memory node.

97 MATHEMATICS AND COMPUTING↗

Multi-class decision system for categorizing industrial asset attack and fault types

According to some embodiments, a plurality of monitoring nodes may each generate a series of current monitoring node values over time that represent a current operation of the industrial asset. A node classifier computer, coupled to the plurality of monitoring nodes, may receive the series of current monitoring node values and generate a set of current feature vectors. The node classifier computer may also access at least one multi-class classifier model having at least one decision boundary. The at least one multi-class classifier model may be executed and the system may transmit a classification result based on the set of current feature vectors and the at least one decision boundary. The classification result may indicate, for example, whether a monitoring node status is normal, attacked, or faulty.

97 MATHEMATICS AND COMPUTING↗

Distributed directory of named data elements in coordination namespace

An approach is described that provides a distributed directory structure within a storage of an information handling system (a local node). A request is received with the request corresponding to a shared virtual address. The shared virtual address that is shared amongst a number of nodes that includes the local node and some remote nodes. A Global Address Space Directory (GASD) is retrieved that corresponds to a global virtual address space. The GASD is stored in a Coordination Namespace that is stored in a memory that is distributed amongst the nodes. A mapping that is included in the GASD is used to determine the node where the shared virtual address currently resides. The shared virtual address is then accessed from the node where it currently resides.

Johns, Charles Ray↗

Pin-by-Pin Core Calculation with an NEM-Based Two-Level Hybrid CMFD Algorithm

In the near future, systematic pin-by-pin core calculations are expected to provide a high level of accuracy. These are being developed in pursuit of high-fidelity tools for analyzing the reactor configurations. One such tool that has recently gained significant attention is the pin-by-pin core calculation via local-global iteration using nonlinear acceleration scheme, such as the One-Node CMFD (Coarse-Mesh Finite Difference) nonlinear algorithm. The One-Node CMFD method uses two correction factors to preserve the interface current, in contrast to the one correction term employed by conventional nonlinear iterative methods such as that proposed by Kord. S. Smith. These correction factors are updated with surface flux and net current which are obtained from a high order local problem. With two correction factors, One-Node CMFD can reduce computing time of local FMFD (Fine-Mesh Finite Difference) as it nonlinearly couples the CMFD and FMFD methods in global-local iterations. Nonetheless, very small mesh size is still required and it consequently requires long computing time for high accuracy. As such, a more flexible approach is needed to address this challenge. This paper presents one such possible approach named the hCMFD (Hybrid CMFD) method. In this method, One-Node CMFD is used to solve the global problem, while Two-Node NEM (Nodal Expansion Method) CMFD replaces FMFD as the solver for the local problem. In this paper, two kinds of CMFD methods has been simultaneously implemented for a global-local nonlinear iteration in order to do pin-by-pin heterogeneous reactor calculations. The global problem is solved by a one-node CMFD which uses two correction factors, while the local fixed-source problem is solved by the conventional two-node NEM CMFD which use one correction factor on a surface. From solution of the global eigenvalue problem, incoming partial current is obtained and it is used as boundary condition of the local fixed-source problems. It has been shown that over 99% of the whole calculations can be done in parallel with the new CMFD method for 2-D problems and the algorithm can be easily parallelized by using the OpenMP parallel scheme. The hCMFD method will enable an efficient pin-by-pin reactor analysis since a very efficient parallel calculation is possible with the hCMFD method. In future works, the hCMFD method will be extended to three-dimensional reactor problem. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Neck management in head and neck squamous cell carcinomas: where do we stand?

Head and neck squamous-cell carcinomas (HNSCCs) have a significant lymph node tropism. This varies considerably depending on the primary tumor site and the Human Papillomavirus (HPV) status of the disease. The best therapeutic option, between up-front lymph node dissection and chemoradiotherapy (CRT) +/− followed by lymph node dissection in case of persistent lymphadenopathy or regional relapse, remains unclear. The purpose of this review is to discuss the pros and cons related to the different approaches of the neck management in HNSCC. A narrative review of the management of the cervical lymph nodes was undertaken. Searches of PubMed database were performed using the terms ‘neck management’ OR ‘cervical lymphadenopathies’ AND ‘head and neck neoplasms’. Recent advances in imaging, pathological analysis, surgery and radiotherapy let to personalize the type of lymph node dissection and, the volumes of radiation therapy. Excluding inoperable patients and unresectable diseases, N3 lymphadenopathies, as well as bulky N2 stages, specifically HPV− or necrotic nodes, would be in favor of an up-front surgical approach, while HPV+ diseases, and lymphadenopathies of unknown primary would support CRT first. However, efficacy of such strategies is challenged by a significant morbidity in the medium and long terms. In the absence of higher level of evidence, the decision-making tools for the neck dissection before or after the CRT are based on the Mehanna’s trial and retrospective studies with significant biases. Consequently, the approaches and the ensuing outcomes remain not homogenous depending on the centers’ experience, in the context of limited data, especially for N2–3 HPV− HNSCC.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Outcomes of Positron Emission Tomography-Staged Clinical N3 Breast Cancer Treated With Neoadjuvant Chemotherapy, Surgery, and Radiotherapy

Purpose: To evaluate the treatment outcome and efficacy of regional lymph node irradiation after neoadjuvant chemotherapy (NCT) and surgery in positron emission tomography (PET)-positive clinical N3 (cN3) breast cancer patients. Methods and Materials: A total of 55 patients with ipsilateral infraclavicular (ICL), internal mammary (IMN), or supraclavicular (SCL) lymph node involvement in the absence of distant metastases, as revealed by an initial PET scan, were retrospectively analyzed. The clinical nodal stage at diagnosis (2002 AJCC) was cN3a in 14 patients (26%), cN3b in 12 patients (22%), and cN3c in 29 patients (53%). All patients were treated with NCT, followed by mastectomy or breast-conserving surgery and subsequent radiotherapy (RT) with curative intent. Results: At the median follow-up of 38 months (range, 9-80 months), 20 patients (36%) had developed treatment failures, including distant metastases either alone or combined with locoregional recurrences that included one ipsilateral breast recurrence (IBR), six regional failures (RF), and one case of combined IBR and RF. Only 3 patients (5.5%) exhibited treatment failure at the initial PET-positive clinical N3 lymph node. The 5-year locoregional relapse-free survival, disease-free survival (DFS), and overall survival rates were 80%, 60%, and 79%, respectively. RT delivered to PET-positive IMN regions in cN3b patients and at higher doses ({>=}55 Gy) to SCL regions in cN3c patients was not associated with improved 5-year IMN/SCL relapse-free survival or DFS. Conclusion: NCT followed by surgery and RT, including the regional lymph nodes, resulted in excellent locoregional control for patients with PET-positive cN3 breast cancer. The primary treatment failure in this group was due to distant metastasis rather than RF. Neither higher-dose RT directed at PET-positive SCL nodes nor coverage of PET-positive IMN nodes was associated with additional gains in locoregional control or DFS.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Dosimetric Comparison of Combined Intensity-Modulated Radiotherapy (IMRT) and Proton Therapy Versus IMRT Alone for Pelvic and Para-Aortic Radiotherapy in Gynecologic Malignancies

Purpose: To perform a dosimetric comparison of intensity-modulated radiotherapy (IMRT), passive scattering proton therapy (PSPT), and intensity-modulated proton therapy (IMPT) to the para-aortic (PA) nodal region in women with locally advanced gynecologic malignancies. Methods and Materials: The CT treatment planning scans of 10 consecutive patients treated with IMRT to the pelvis and PA nodes were identified. The clinical target volume was defined by the primary tumor for patients with cervical cancer and by the vagina and paravaginal tissues for patients with endometrial cancer, in addition to the regional lymph nodes. The IMRT, PSPT, and IMPT plans were generated using the Eclipse Treatment Planning System and were analyzed for various dosimetric endpoints. Two groups of treatment plans including proton radiotherapy were created: IMRT to pelvic nodes with PSPT to PA nodes (PSPT/IMRT), and IMRT to pelvic nodes with IMPT to PA nodes (IMPT/IMRT). The IMRT and proton RT plans were optimized to deliver 50.4 Gy or Gy (relative biologic effectiveness [RBE)), respectively. Dose-volume histograms were analyzed for all of the organs at risk. The paired t test was used for all statistical comparison. Results: The small-bowel V{sub 20}, V{sub 30}, V{sub 35}, andV{sub 40} were reduced in PSPT/IMRT by 11%, 18%, 27%, and 43%, respectively (p < 0.01). Treatment with IMPT/IMRT demonstrated a 32% decrease in the small-bowel V{sub 20}. Treatment with PSPT/IMRT showed statistically significant reductions in the body V{sub 5-20}; IMPT/IMRT showed reductions in the body V{sub 5-15}. The dose received by half of both kidneys was reduced by PSPT/IMRT and by IMPT/IMRT. All plans maintained excellent coverage of the planning target volume. Conclusions: Compared with IMRT alone, PSPT/IMRT and IMPT/IMRT had a statistically significant decrease in dose to the small and large bowel and kidneys, while maintaining excellent planning target volume coverage. Further studies should be done to correlate the clinical significance of these findings.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Vascular endothelial growth factor-D is a key molecule that enhances lymphatic metastasis of soft tissue sarcomas

Studies on lymph node metastasis of soft tissue sarcomas are insufficient because of its rarity. In this study, we examined the expressions of vascular endothelial growth factor (VEGF)-C and VEGF-D in soft tissue sarcomas metastasized to lymph nodes. In addition, the effects of the two molecules on the barrier function of a lymphatic endothelial cell monolayer against sarcoma cells were analyzed. We examined 7 patients who had soft tissue sarcomas with lymph node metastases and who had undergone neither chemotherapy nor radiotherapy before lymphadenectomy. Immunohistochemistry revealed that 2 of 7 sarcomas that metastasized to lymph nodes expressed VEGF-C both in primary and metastatic lesions. On the other hand, VEGF-D expression was detected in 4 of 7 primary and 7 of 7 metastatic lesions, respectively. Interestingly, 3 cases that showed no VEGF-D expression at primary sites expressed VEGF-D in metastatic lesions. Recombinant VEGF-C at 10{sup -8} and VEGF-D at 10{sup -7}and 10{sup -8} g/ml significantly increased the random motility of lymphatic endothelial cells compared with controls. VEGF-D significantly increased the migration of sarcoma cells through lymphatic endothelial monolayers. The fact that VEGF-D induced the migration of fibrosarcomas through the lymphatic endothelial monolayer is the probable reason for the strong relationship between VEGF-D expression and lymph node metastasis in soft tissue sarcomas. The important propensities of this molecule for the increase of lymph node metastases are not only lymphangiogenesis but also down-regulation of the barrier function of lymphatic endothelial monolayers, which facilitates sarcoma cells entering the lymphatic circulation.

60 APPLIED LIFE SCIENCES↗

Relaxation mechanisms, structure and properties of semi-coherent interfaces

In this work, using the Cu–Ni (111) semi-coherent interface as a model system, we combine atomistic simulations and defect theory to reveal the relaxation mechanisms, structure, and properties of semi-coherent interfaces. By calculating the generalized stacking fault energy (GSFE) profile of the interface, two stable structures and a high-energy structure are located. During the relaxation, the regions that possess the stable structures expand and develop into coherent regions; the regions with high-energy structure shrink into the intersection of misfit dislocations (nodes). This process reduces the interface excess potential energy but increases the core energy of the misfit dislocations and nodes. The core width is dependent on the GSFE of the interface. The high-energy structure relaxes by relative rotation and dilatation between the crystals. The relative rotation is responsible for the spiral pattern at nodes. The relative dilatation is responsible for the creation of free volume at nodes, which facilitates the nodes’ structural transformation. Several node structures have been observed and analyzed. In conclusion, the various structures have significant impact on the plastic deformation in terms of lattice dislocation nucleation, as well as the point defect formation energies.

36 MATERIALS SCIENCE↗

A Dirichlet reputation system in reliable routing of wireless ad hoc network

Ad hoc networks are very helpful in situations when no fixed network infrastructure is available, such as natural disasters and military conflicts. In such a network, all wireless nodes are equal peers simultaneously serving as both senders and routers for other nodes. Therefore, how to route packets through reliable paths becomes a fundamental problems when behaviors of certain nodes deviate from wireless ad hoc routing protocols. We proposed a novel Dirichlet reputation model based on Bayesian inference theory which evaluates reliability of each node in terms of packet delivery. Our system offers a way to predict and select a reliable path through combination of first-hand observation and second-hand reputation reports. We also proposed moving window mechanism which helps to adjust ours responsiveness of our system to changes of node behaviors. We integrated the Dirichlet reputation into routing protocol of wireless ad hoc networks. Our extensive simulation indicates that our proposed reputation system can improve good throughput of the network and reduce negative impacts caused by misbehaving nodes.

99 GENERAL AND MISCELLANEOUS↗

Large-scale seismic waveform quality metric calculation using Hadoop

Here in this work we investigated the suitability of Hadoop MapReduce and Apache Spark for large-scale computation of seismic waveform quality metrics by comparing their performance with that of a traditional distributed implementation. The Incorporated Research Institutions for Seismology (IRIS) Data Management Center (DMC) provided 43 terabytes of broadband waveform data of which 5.1 TB of data were processed with the traditional architecture, and the full 43 TB were processed using MapReduce and Spark. Maximum performance of ~0.56 terabytes per hour was achieved using all 5 nodes of the traditional implementation. We noted that I/O dominated processing, and that I/O performance was deteriorating with the addition of the 5th node. Data collected from this experiment provided the baseline against which the Hadoop results were compared. Next, we processed the full 43 TB dataset using both MapReduce and Apache Spark on our 18-node Hadoop cluster. We conducted these experiments multiple times with various subsets of the data so that we could build models to predict performance as a function of dataset size. We found that both MapReduce and Spark significantly outperformed the traditional reference implementation. At a dataset size of 5.1 terabytes, both Spark and MapReduce were about 15 times faster than the reference implementation. Furthermore, our performance models predict that for a dataset of 350 terabytes, Spark running on a 100-node cluster would be about 265 times faster than the reference implementation. We do not expect that the reference implementation deployed on a 100-node cluster would perform significantly better than on the 5-node cluster because the I/O performance cannot be made to scale. Finally, we note that although Big Data technologies clearly provide a way to process seismic waveform datasets in a high-performance and scalable manner, the technology is still rapidly changing, requires a high degree of investment in personnel, and will likely require significant changes in other parts of our infrastructure. Nevertheless, we anticipate that as the technology matures and third-party tool vendors make it easier to manage and operate clusters, Hadoop (or a successor) will play a large role in our seismic data processing.

58 GEOSCIENCES↗

GPU-enabled extreme-scale turbulence simulations: Fourier pseudo-spectral algorithms at the exascale using OpenMP offloading

Fourier pseudo-spectral methods for nonlinear partial differential equations are of wide interest in many areas of advanced computational science, including direct numerical simulation of three-dimensional (3-D) turbulence governed by the Navier-Stokes equations in fluid dynamics. This paper presents a new capability for simulating turbulence at a new record resolution up to 35 trillion grid points, on the world's first exascale computer, Frontier, comprising AMD MI250x GPUs with HPE's Slingshot interconnect and operated by the US Department of Energy's Oak Ridge Leadership Computing Facility (OLCF). Key programming strategies designed to take maximum advantage of the machine architecture involve performing almost all computations on the GPU which has the same memory capacity as the CPU, performing all-to-all communication among sets of parallel processes directly on the GPU, and targeting GPUs efficiently using OpenMP offloading for intensive number-crunching including 1-D Fast Fourier Transforms (FFT) performed using AMD ROCm library calls. With 99% of computing power on Frontier being on the GPU, leaving the CPU idle leads to a net performance gain via avoiding the overhead of data movement between host and device except when needed for some I/O purposes. Memory footprint including the size of communication buffers for MPI_ALLTOALL is managed carefully to maximize the largest problem size possible for a given node count. Detailed performance data including separate contributions from different categories of operations to the elapsed wall time per step are reported for five grid resolutions, from 2048 3 on a single node to 32768 3 on 4096 or 8192 nodes out of 9408 on the system. Both 1D and 2D domain decompositions which divide a 3D periodic domain into slabs and pencils respectively are implemented. The present code suite (labeled by the acronym GESTS, GPUs for Extreme Scale Turbulence Simulations) achieves a figure of merit (in grid points per second) exceeding goals set in the Center for Accelerated Application Readiness (CAAR) program for Frontier. The performance attained is highly favorable in both weak scaling and strong scaling, with notable departures only for 2048 3 where communication is entirely intra-node, and for 32768 3 , where a challenge due to small message sizes does arise. Communication performance is addressed further using a lightweight test code that performs all-to-all communication in a manner matching the full turbulence simulation code. Performance at large problem sizes is affected by both small message size due to high node counts as well as dragonfly network topology features on the machine, but is consistent with official expectations of sustained performance on Frontier. Overall, although not perfect, the scalability achieved at the extreme problem size of 32768 3 (and up to 8192 nodes — which corresponds to hardware rated at just under 1 exaflop/sec of theoretical peak computational performance) is arguably better than the scalability observed using prior state-of-the-art algorithms on Frontier's predecessor machine (Summit) at OLCF. New science results for the study of intermittency in turbulence enabled by this code and its extensions are to be reported separately in the near future.

3D fast Fourier transform↗

Variable Circular Collimator in Robotic Radiosurgery: A Time-Efficient Alternative to a Mini-Multileaf Collimator?

Purpose: Compared with many small circular beams used in CyberKnife treatments, beam's eye view-shaped fields are generally more time-efficient for dose delivery. However, beam's eye view-shaping devices, such as a mini-multileaf collimator (mMLC), are not presently available for CyberKnife, although a variable-aperture collimator (Iris, 12 field diameters; 5-60 mm) is available. We investigated whether the Iris can mimic noncoplanar mMLC treatments using a limited set of principal beam orientations (nodes) to produce time-efficient treatment plans. Methods and Materials: The data from 10 lung cancer patients and the beam-orientation optimization algorithm 'Cycle' were used to generate stereotactic treatment plans (3 x 20 Gy) for a CyberKnife virtually equipped with a mMLC. Typically, 10-16 favorable beam orientations were selected from 117 available robot node positions using beam's eye view-shaped fields with uniform fluence. Second, intensity-modulated Iris plans were generated by inverse optimization of nonisocentric circular candidate beams targeted from the same nodes selected in the mMLC plans. The plans were evaluated using the mean lung dose, lung volume receiving {>=}20 Gy, conformality index, number of nodes, beams, and monitor units, and estimated treatment time. Results: The mMLC plans contained an average of 12 nodes and 11,690 monitor units. For a comparable mean lung dose, the Iris plans contained 12 nodes, 64 beams, and 21,990 monitor units. The estimated fraction duration was 12.2 min (range, 10.8-13.5) for the mMLC plans and 18.4 min (range, 12.9-28.5) for the Iris plans. In contrast to the mMLC plans, the treatment time for the Iris plans increased with an increasing target volume. The Iris plans were, on average, 40% longer than the corresponding mMLC plans for small targets (<80 cm{sup 3}) and {<=}121% longer for larger targets. For a comparable conformality index, similar results were obtained. Conclusion: For stereotactic lung irradiation, time-efficient and high-quality plans were obtained for robotic-controlled noncoplanar treatments using a mMLC. Iris is a time-efficient alternative for small targets, with similar or better plan quality.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Efficient Heterogeneous Execution on Large Multicore and Accelerator Platforms: Case Study Using a Block Tridiagonal Solver

The algorithmic and implementation principles are explored in gainfully exploiting GPU accelerators in conjunction with multicore processors on high-end systems with large numbers of compute nodes, and evaluated in an implementation of a scalable block tridiagonal solver. The accelerator of each compute node is exploited in combination with multicore processors of that node in performing block-level linear algebra operations in the overall, distributed solver algorithm. Optimizations incorporated include: (1) an efficient memory mapping and synchronization interface to minimize data movement, (2) multi-process sharing of the accelerator within a node to obtain balanced load with multicore processors, and (3) an automatic memory management system to efficiently utilize accelerator memory when sub-matrices spill over the limits of device memory. Results are reported from our novel implementation that uses MAGMA and CUBLAS accelerator software systems simultaneously with ACML for multithreaded execution on processors. Overall, using 940 nVidia Tesla X2090 accelerators and 15,040 cores, the best heterogeneous execution delivers a 10.9-fold reduction in run time relative to an already efficient parallel multicore-only baseline implementation that is highly optimized with intra-node and inter-node concurrency and computation-communication overlap. Detailed quantitative results are presented to explain all critical runtime components contributing to hybrid performance.

Park, Alfred J↗

Diverse assemblies of the (4,4) grid layers exemplified in Zn(II)/Co(II) coordination polymers with dual linear ligands

Diverse (4,4) grid layers are exemplified in five two-dimensional coordination polymers with dual µ{sub 2}-bridged ligands, namely, ([Zn(cbaa)(bpp)]·H{sub 2}O){sub n} (1), [Zn{sub 2}(cbaa){sub 2}(bpy)]{sub n} (2), [Co{sub 2}(cbaa){sub 2}(bpp){sub 2}]{sub n} (3), [Co(cbaa)(bpp)]{sub n} (4), and [Co(bdaa)(bpp)(H{sub 2}O){sub 2}]{sub n} (5) (H{sub 2}cbaa=4-carboxybenzeneacetic acid, bpp=1,3-di(4-pyridyl)propane, bpy=4,4′-bipyridyl, and H{sub 2}bdaa=1,4-benzenediacrylic acid). For 1, two (4,4) grid layers with [ZnN{sub 2}O{sub 2}] tetrahedron as the node are held together by lattice water forming a H-bonding bilayer. Individual (4,4) grid layer in 2 is based on (Zn{sub 2}(OCO){sub 4}) paddlewheel unit as the node. Two (4,4) grid layers with (Co{sub 2}O(OCO){sub 2}) dimer as the node are covalently interconnected by organic ligands affording a thick bilayer of 3 with new framework topology. The different entanglements between two coincident (4,4) grid layers with [CoN{sub 2}O{sub 4}] octahedron as the node leads to two 2D→2D interpenetrated structures for 4 and 5. Furthermore, fluorescent properties of 1 and 2 as well as magnetic properties of 3 are investigated. - Graphical abstract: Diverse assemblies of the (4,4) grid layers with different network nodes forms five coordination polymers that are well characterized by IR, TGA, element analysis, fluorescent and magnetic measurement. - Highlights: • Diverse assemblies of the (4,4) grid layers with different structural units as the nodes. • A new topology type with the uninodal 6-connected net of (4{sup 12}.5{sup 2}.6) is found. • Intense fluorescence emissions with a rare blue-shift of 55 nm compared to free carboxylate ligand.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multiple-view, multiple-selection visualization of simulation geometry in CMS

Fireworks, the event-display program of CMS, was extended with an advanced geometry visualization package. ROOT's TGeo geometry is used as internal representation, shared among several geometry views. Each view is represented by a GUI list-tree widget, implemented as a flat vector to allow for fast searching, selection, and filtering by material type, node name, and shape type. Display of logical and physical volumes is supported. Color, transparency, and visibility flags can be modified for each node or for a selection of nodes. Further operations, like opening of a new view or changing of the root node, can be performed via a context menu. Node selection and graphical properties determined by the list-tree view can be visualized in any 3D graphics view of Fireworks. As each 3D view can display any number of geometry views, a user is free to combine different geometry-view selections within the same 3D view. Node-selection by proximity to a given point is possible. A visual clipping box can be set for each geometry view to limit geometry drawing into a specified region. Visualization of geometric overlaps, as detected by TGeo, is also supported. The geometry visualization package is used for detailed inspection and display of simulation geometry with or without the event data. It also serves as a tool for geometry debugging and inspection, facilitating development of geometries for CMS detector upgrades and for SLHC.

Bauerdick, L. A.T.↗