Search NASA⌕ Search

SEARCH · Search NASA

Results for “map task”

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 397 records · Page 22

Nonlocal atlas-guided multi-channel forest learning for human brain labeling

Purpose: It is important for many quantitative brain studies to label meaningful anatomical regions in MR brain images. However, due to high complexity of brain structures and ambiguous boundaries between different anatomical regions, the anatomical labeling of MR brain images is still quite a challenging task. In many existing label fusion methods, appearance information is widely used. However, since local anatomy in the human brain is often complex, the appearance information alone is limited in characterizing each image point, especially for identifying the same anatomical structure across different subjects. Recent progress in computer vision suggests that the context features can be very useful in identifying an object from a complex scene. In light of this, the authors propose a novel learning-based label fusion method by using both low-level appearance features (computed from the target image) and high-level context features (computed from warped atlases or tentative labeling maps of the target image). Methods: In particular, the authors employ a multi-channel random forest to learn the nonlinear relationship between these hybrid features and target labels (i.e., corresponding to certain anatomical structures). Specifically, at each of the iterations, the random forest will output tentative labeling maps of the target image, from which the authors compute spatial label context features and then use in combination with original appearance features of the target image to refine the labeling. Moreover, to accommodate the high inter-subject variations, the authors further extend their learning-based label fusion to a multi-atlas scenario, i.e., they train a random forest for each atlas and then obtain the final labeling result according to the consensus of results from all atlases. Results: The authors have comprehensively evaluated their method on both public LONI-LBPA40 and IXI datasets. To quantitatively evaluate the labeling accuracy, the authors use the dice similarity coefficient to measure the overlap degree. Their method achieves average overlaps of 82.56% on 54 regions of interest (ROIs) and 79.78% on 80 ROIs, respectively, which significantly outperform the baseline method (random forests), with the average overlaps of 72.48% on 54 ROIs and 72.09% on 80 ROIs, respectively. Conclusions: The proposed methods have achieved the highest labeling accuracy, compared to several state-of-the-art methods in the literature.

61 RADIATION PROTECTION AND DOSIMETRY↗

Classification of Orbits in Poincare Maps Using Machine Learning

Poincare plots, also called Poincare maps, are used by plasma physicists to understand the behavior of magnetically confined plasma in numerical simulations of a tokamak. These plots are created by the intersection of field lines with a two-dimensional poloidal plane that is perpendicular to the axis of the torus representing the tokamak. A plot is composed of multiple orbits, each created by a different field line as it goes around the torus. Each orbit can have one of four distinct shapes, or classes, that indicate changes in the topology of the magnetic fields confining the plasma. Given the (x, y) coordinates of the points that form an orbit, the analysis task is to assign a class to the orbit, a task that appears ideally suited for a machine learning approach. In this paper, we describe how we overcame two major challenges in solving this problem - creating a high-quality training set, with few mislabeled orbits, and converting the coordinates of the points into features that are discriminating, despite the variation within the orbits of a class and the apparent similarities between orbits of different classes. Our automated approach is not only more objective and accurate than visual classification, but is also less tedious, making it easier for plasma physicists to analyze the topology of magnetic fields from numerical simulations of the tokamak.

97 MATHEMATICS AND COMPUTING↗

Optimizing Alabama’s CO 2 Storage in Shelby County (Project OASIS): Task 4.0 Deliverable – Geologic Analysis Report

Project OASIS (Optimizing Alabama’s CO 2 Storage in Shelby County) is a geologic and reservoir characterization study designed to evaluate deep saline formations for potential long-term carbon dioxide (CO 2 ) storage in central Alabama near the National Carbon Capture Center (NCCC) and Alabama Power’s Plant Gaston. The project centers on the Cambro-Ordovician Knox Group and underlying strata such as the Conasauga and Rome Formations, which were investigated through the drilling of two stratigraphic test wells to obtain electronic well logs, core, and sidewall core plugs. These data provide direct measurements of porosity, permeability, and lithologic variability critical for reservoir characterization. Complementing the well program, a limited 2D seismic survey was acquired to help select the site for Westover #2, and a more regional Seismic Exchange (SEI) seismic survey was licensed and interpreted to define structural and stratigraphic frameworks in a new Static Earth Model (SEM), map reservoir continuity, and identify potential sealing intervals. Integrated with geologic and reservoir modeling, these datasets form the basis for evaluating storage capacity, injectivity, and containment.

20 FOSSIL-FUELED POWER PLANTS↗

Clustering-Based Predictive Analytics to Improve Scientific Data Discovery

Given the sheer volume of scientific data archived within the data-intensive projects at the US Department of Energy's Oak Ridge National Laboratory, finding precisely what data we are looking for may not be a trivial task; conversely, we may also miss a more prominent data product. To address such issues, we propose improving the data discovery system and using data analytics methods to comprehend what specific users might be interested in based on their physiological state, search patterns, and past data usage history. This work's primary goal is to prune the complexity, increase the visibility of popular data products, and direct users toward the data that best meet their needs. The proposed algorithm constructs a user profile based on the user's explicit or implicit interactions with the system, such as items they are currently looking at on-site and the key metadata mappings related to the data set. The pattern is then used to build a training data set, which will help find relevant data to recommend to the user.

Devarakonda, Ranjeet↗

Methodology to design a municipal solid waste pre-collection system. A case study

Highlights: • MSW recovery starts at homes; therefore it is important to facilitate it to people. • Additionally, to optimize MSW collection a previous pre-collection must be planned. • A methodology to organize pre-collection considering several factors is presented. • The methodology has been verified applying it to a Spanish middle town. - Abstract: The municipal solid waste (MSW) management is an important task that local governments as well as private companies must take into account to protect human health, the environment and to preserve natural resources. To design an adequate MSW management plan the first step consists in defining the waste generation and composition patterns of the town. As these patterns depend on several socio-economic factors it is advisable to organize them previously. Moreover, the waste generation and composition patterns may vary around the town and over the time. Generally, the data are not homogeneous around the city as the number of inhabitants is not constant nor it is the economic activity. Therefore, if all the information is showed in thematic maps, the final waste management decisions can be made more efficiently. The main aim of this paper is to present a structured methodology that allows local authorities or private companies who deal with MSW to design its own MSW management plan depending on the available data. According to these data, this paper proposes two ways of action: a direct way when detailed data are available and an indirect way when there is a lack of data and it is necessary to take into account bibliographic data. In any case, the amount of information needed is considerable. This paper combines the planning methodology with the Geographic Information Systems to present the final results in thematic maps that make easier to interpret them. The proposed methodology is a previous useful tool to organize the MSW collection routes including the selective collection. To verify the methodology it has been successfully applied to a Spanish town.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

What is the optimal way to prepare a Bell state using measurement and feedback?

Recent work has shown that the use of quantum feedback can significantly enhance both the speed and success rate of measurement-based remote entanglement generation, but it is generally unknown what feedback protocols are optimal for these tasks. In this work, we consider two common measurements that are capable of projecting into pairwise entangled states, namely half- and full-parity measurements of two qubits, and determine in each case a globally optimal protocol for generation of entanglement. For the half-parity measurement, we rederive a previously described protocol using more general methods and prove that it is globally optimal for several figures of merit, including maximal concurrence or fidelity and minimal time to reach a specified concurrence or fidelity. For the full-parity measurement, we derive a protocol for rapid entanglement generation related to that of (Hill, Ralph, Phys. Rev. A 77, 014305), and then map the dynamics of the concurrence of the state to the Bloch vector length of an effective qubit. This mapping allows us to prove several optimality results for feedback protocols with full-parity measurements. We further show that our full-parity protocol transfers entanglement optimally from one qubit to the other amongst all measurement-based schemes. The methods developed here will be useful for deriving feedback protocols and determining their optimality properties in many other quantum systems subject to measurement and unitary operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dense autoencoders, clustering techniques, and semi-supervised learning for HPGe $γ$-spectra

Classifying high-resolution gamma spectra by their isotopic content is an essential task in nuclear forensics and other applications. Traditional analysis methods are often time-intensive, but machine learning (ML) may help analysts quickly process many spectra. Such methods tend to rely on abundant, well-labeled data for training. Historical gamma data exists in various fields but is not uniformly useful for supervised ML due to inconsistent labeling. Here, to address some of these challenges, we present a method to classify and organize unlabeled data from high-purity germanium detectors using an autoencoding neural network (autoencoder). We trained dense autoencoders to compress gamma data into latent representations that enable efficient data characterization. By clustering the encoded spectra or lower-dimensional mappings of them, we identified and removed portions of over-abundant data categories, resulting in a more balanced dataset and improved autoencoder performance. This encoding and clustering pipeline also enabled the organization of spectra into self-consistent categories. Finally, we found that encoded representations showed potential as inputs for semi-supervised learning of nuclide identification (NID) labels, achieving an average F1 score of 0.85 ± 0.03 when mapping encodings to a set of 65 isotope labels.

Autoencoders↗

An end-to-end deep learning solution for automated LiDAR tree detection in the urban environment

Cataloging and classifying trees in the urban environment is a crucial step in urban and environmental planning; however, manual collection and maintenance of this data is expensive and time-consuming. Although algorithmic approaches that rely on remote sensing data have been developed for tree detection in forests, they generally struggle in the more varied urban environment. This work proposes a novel end-to-end deep learning method for the detection of trees in the urban environment from remote sensing data. Specifically, we develop and train a novel PointNet-based neural network architecture to predict tree locations directly from LiDAR data augmented with multi-spectral imagery. We compare this model to a number of high-performing baselines on a large and varied dataset in the Southern California region, and find that our method outperforms all baselines in terms of tree detection ability (75.5% F-score) and positional accuracy (2.28 meter root mean squared error), while being highly efficient. We then analyze and compare the sources of errors, and how these reveal the strengths and weaknesses of each approach. Our results highlight the importance of fusing spectral and structural information for remote sensing tasks in complex urban environments.

54 ENVIRONMENTAL SCIENCES↗

WE-FG-BRB-02: Spatial Mapping of the RBE of Scanned Particle Beams

The physical pattern of energy deposition and the enhanced relative biological effectiveness (RBE) of protons and carbon ions compared to photons offer unique and not fully understood or exploited opportunities to improve the efficacy of radiation therapy. Variations in RBE within a pristine or spread out Bragg peak and between particle types may be exploited to enhance cell killing in target regions without a corresponding increase in damage to normal tissue structures. In addition, the decreased sensitivity of hypoxic tumors to photon-based therapies may be partially overcome through the use of more densely ionizing radiations. These and other differences between particle and photon beams may be used to generate biologically optimized treatments that reduce normal tissue complications. In this symposium, speakers will examine the impact of the RBE of charged particles on measurable biological endpoints, treatment plan optimization, and the prediction or retrospective assessment of treatment outcomes. In particular, an AAPM task group was formed to critically examine the evidence for a spatially-variant RBE in proton therapy. Current knowledge of proton RBE variation with respect to dose, biological endpoint, and physics parameters will be reviewed. Further, the clinical relevance of these variations will be discussed. Recent work focused on improving simulations of radiation physics and biological response in proton and carbon ion therapy will also be presented. Finally, relevant biology research and areas of research needs will be highlighted, including the dependence of RBE on genetic factors including status of DNA repair pathways, the sensitivity of cancer stem-like cells to charged particles, the role of charged particles in hypoxic tumors, and the importance of fractionation effects. In addition to the physical advantages of protons and more massive ions over photons, the future application of biologically optimized treatment plans and their potential to provide higher levels of local tumor control and improved normal tissue sparing will be discussed. Learning Objectives: To assess whether the current practice of a constant RBE of 1.1 should be revised or maintained in proton therapy and to evaluate the potential clinical consequences of delivering RBE-weighted dose distributions based on variable RBE To review current research on biological models used to predict the increased biological effectiveness of proton and carbon ions to help move towards a practical understanding and implementation of biological optimization in particle therapy To discuss potential differences in biological mechanisms between photons and charged particles (light and heavy ions) that could impact clinical cancer therapy H. Paganetti, NCI U19 CA21239D. Grosshans, Our research is supported by the NCIK. Held, Funding Support: National Cancer Institute of the National Institutes of Health, USA, under Award Number R21CA182259 and Federal Share of Program Income Earned by Massachusetts General Hospital on C06CA059267, Proton Therapy Research and Treatment Center.

60 APPLIED LIFE SCIENCES↗

HFTS-2 (Final Report)

This report delves into the research program, identified tasks, various studies, observations, results, and conclusions under the Hydraulic Fracturing Test Site (HFTS-2) project. This test site is located in Loving County close to the Texas, New Mexico border. The program targeted the Wolfcamp formation in Delaware Basin. The aim of the project was to improve our understanding of hydraulic fracturing processes to not only optimize unconventional resource development in US Basins but to minimize environmental footprint as well. Various new diagnostic technologies were demonstrated at this site, including distributed acoustic microseismic, high resolution strain using Rayleigh frequency band (DSS-RFS), and in-fill proppant logging tool. Significant conclusions from this study include: 1) lateral and vertical fracture growth mapping as well as proppant transport behavior, 2) Use of DSS-RFS as a diagnostic tool to understand cluster level behavior, 3) Validation of proppant log, both at core scale as well as in-fill well implementation, and 4) New modeling tools to map far-field strain response using distributed strain sensing data. Specifically, far-field fracture distribution is influenced by linear fracture corridors defined by the stress-state as well as clustering behavior influenced by spatio-temporal effects. Depletion impacts on new stimulation was demonstrated and technically quantified. Significant vertical fracture height growth was observed. However, our understanding is limited by available gauge data availability. Numerical strain modeling techniques have been developed and demonstrated to help understand observed strain response behavior. Finally, proppant log has been further validated as a useful tool to map propped zones within the SRV. It has also shown very strong correlation with observed drawdown behavior at this test site. This report will detail many of these studies as well as technical results and conclusions from said studies. These include general subsurface characterization work, completion designs as implemented, studies looking at fracture geometry, high resolution microseismic study including source mechanisms, advanced DSS-RFS studies including drainage characterization, core characterization results, proppant analysis (core and in-fill child well), geochemistry, etc.

02 PETROLEUM↗

Mechanism-Resolved PFM of Ferroionic and Ferroelectric Responses in Thickness-Gradient Hf 0.5 Zr 0.5 O 2 Libraries

Resolving growth mechanisms and thickness evolution of functional properties is one of the key tasks in materials discovery and optimization involving thin-film materials, traditionally requiring significant experimental budgets. Here we introduce the combination of thickness-gradient libraries and automated scanning probe microscopy as a systematic pathway to elucidate growth modes and disentangle ferroelectric and electrochemical contributions in ferroelectric thin films. As a model system, we explore the Hf 0.5 Zr 0.5 O 2 (HZO) gradient thin films grown on La x Sr 1-x MnO 3 (LSMO) bottom electrode thin films. Automated piezoresponse force microscopy, spectroscopy, and lithography reveals that irreversible topographic deformation arises from electrochemical activity at the LSMO surface, whereas reversible phase inversion in HZO reflects ferroelectric switching. Automated topography height-map scans are used to further quantify nucleation density, particle-size evolution, and roughness correlations across the thickness-gradient, demonstrating that improved plume stabilization during growth suppresses interfacial reactions and promotes dense, fine-grained HZO conducive to ferroelectric phase formation. This combined materials-engineering and automated-SPM framework establishes a platform for high-throughput, mechanism-resolved characterization of ferroionic and ferroelectric responses in complex oxide films.

FOS: Physical sciences↗

Genuine k -partite correlations and entanglement in the ground state of the Dicke model for interacting qubits

Here, in this work, we calculate and study correlations of the Dicke model in the presence of qubit–qubit interaction. Whereas the analysis of correlations among its subsystems is essential for the understanding of corresponding critical phenomena and for performing quantum information tasks, the majority of correlation measures are restricted to bipartitions due to the inherent challenges associated with handling multiple partitions. To circunvent this we employ the calculation of Genuine Multipartite Correlations (GMC) based on the invariance of our model under particle permutation. We then quantify the correlations within each subpart of the system, as well as the percentage contribution of each GMC of order $k$, highlighting the many-body behaviors for different regimes of parameters. Additionally, we show that GMC signal both first- and second-order quantum phase transitions present in the model. Furthermore, as GMC encompasses both classical and quantum correlations, we employ Quantum Fisher Information (QFI) to detect genuine multipartite entanglement. Ultimately, we map the Dicke model with interacting qubits to spin in solids interacting with a quantum field of magnons, thus demonstrating a potential experimental realization of this model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Web-Based Reanalysis Intercomparison Tools (WRIT) for Analysis and Comparison of Reanalyses and Other Datasets

While atmospheric reanalysis datasets are widely used in climate science, many technical issues hinder comparing them to each other and to observations. The reanalysis fields are stored in diverse file architectures, data formats, and resolutions. Their metadata, such as variable name and units, can also differ. Individual users have to download the fields, convert them to a common format, store them locally, change variable names, regrid if needed, and convert units. Even if a dataset can be read via the Open-Source Project for a Network Data Access Protocol (commonly known as OPeNDAP) or a similar protocol, most of this work is still needed. All of these tasks take time, effort, and money. Our group at the Cooperative Institute for Research in the Environmental Sciences at the University of Colorado and affiliated colleagues at the NOAA's Earth System Research Laboratory Physical Sciences Division have expertise both in making reanalysis datasets available and in creating web-based climate analysis tools that have been widely used throughout the meteorological community. To overcome some of the obstacles in reanalysis intercomparison, we have created a set of web-based Reanalysis Intercomparison Tools (WRIT) at www.esrl.noaa.gov/psd/data/writ/. WRIT allows users to easily plot and compare reanalysis datasets, and to test hypotheses. For standard pressure-level and surface variables there are tools to plot trajectories, monthly mean maps and vertical cross sections, and monthly mean time series. Some observational datasets are also included. Users can refine date, statistics, and plotting options. WRIT also facilitates the mission of the Reanalyses.org website as a convenient toolkit for studying the reanalysis datasets.

54 ENVIRONMENTAL SCIENCES↗

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

Toward a Visualization-Supported Workflow for Cyber Alert Management using Threat Models and Human-Centered Design

Cyber network analysts follow complex processes in their investigations of potential threats to their network. Much research is dedicated to providing automated tool support in the effort to make their tasks more efficient, accurate, and timely. This tool support comes in a variety of implementations from machine learning algorithms that monitor streams of data to visual analytic environments for exploring rich and noisy data sets. Cyber analysts, however, often speak of a need for tools which help them merge the data they already have and help them establish appropriate baselines against which to compare potential anomalies. Furthermore, existing threat models that cyber analysts regularly use to structure their investigation are not often leveraged in support tools. We report on our work with cyber analysts to understand they analytic process and how one such model, the MITRE ATT&CK Matrix [32], is used to structure their analytic thinking. We present our efforts to map specific data needed by analysts into the threat model to inform our eventual visualization designs. We examine data mapping for gaps where the threat model is under-supported by either data or tools. We discuss these gaps as potential design spaces for future research efforts. We also discuss the design of a prototype tool that combines machine-learning and visualization components to support cyber analysts working with this threat model.

Cyber Security↗

Deep data analysis via physically constrained linear unmixing: universal framework, domain examples, and a community-wide platform

Abstract Many spectral responses in materials science, physics, and chemistry experiments can be characterized as resulting from the superposition of a number of more basic individual spectra. In this context, unmixing is defined as the problem of determining the individual spectra, given measurements of multiple spectra that are spatially resolved across samples, as well as the determination of the corresponding abundance maps indicating the local weighting of each individual spectrum. Matrix factorization is a popular linear unmixing technique that considers that the mixture model between the individual spectra and the spatial maps is linear. Here, we present a tutorial paper targeted at domain scientists to introduce linear unmixing techniques, to facilitate greater understanding of spectroscopic imaging data. We detail a matrix factorization framework that can incorporate different domain information through various parameters of the matrix factorization method. We demonstrate many domain-specific examples to explain the expressivity of the matrix factorization framework and show how the appropriate use of domain-specific constraints such as non-negativity and sum-to-one abundance result in physically meaningful spectral decompositions that are more readily interpretable. Our aim is not only to explain the off-the-shelf available tools, but to add additional constraints when ready-made algorithms are unavailable for the task. All examples use the scalable open source implementation from https://github.com/ramkikannan/nmflibrary that can run from small laptops to supercomputers, creating a user-wide platform for rapid dissemination and adoption across scientific disciplines.

47 OTHER INSTRUMENTATION↗

EGS Collab Earth Modeling: Integrated 3D Model of the Testbed

The EGS Collab project is conducting a series of stimulation and interwell flow tests in an intermediate scale (~10-20 m) testbed located on the 4850 level in the Sanford Underground Research Facility (SURF) in Lead, South Dakota. The testbed consists of eight ~200 ft (~60 m) HQ-diameter (9.6 cm) boreholes that are drilled into the Poorman Formation from the western rib of the West Access Drift. Of the eight boreholes, one borehole is used as an injection/stimulation well, another sub-parallel borehole located about 10 m away from the injection well is used as a production well, and rest of the other boreholes are used as monitoring wells. For 3D visualization of the testbed as well as to provide spatially accurate and consistent parameter data for geomechanical and geophysical process modeling tasks, we are using Leapfrog Software (Seequent Limited). For analysis of fractures and creation of conditioned stochastic discrete fracture network (CS-DFN) model of the testbed, we are using FracMan (Golder Associates Inc.). As of mid-May 2019, the EGS Collab Leapfrog database contains the general layout of the drifts/shafts at the 4850 and 4100 levels; generalized geologic framework model of a domain that spans both the 4850 and 4100 levels; the CS-DFN of the testbed; and layouts of the EGS Collab testbed boreholes, kISMET testbed boreholes, and other existing boreholes at the 4850 level. This information has been obtained from the SURF Vulcan database, detailed laser scan and point surveys of borehole collar locations, directional surveys of borehole trajectories, and mapping of features in the drifts, boreholes, and cores. Similarly, other types of data that have been incorporated into the Leapfrog database include static features of the testbed such as natural discontinuities (e.g., fractures, weeps), location of monitoring instruments, and stimulation notches. Baseline geophysical characterization results (e.g., seismic, ERT, temperature, etc.) are also imported into the Leapfrog database. The location and size of packers, various point-source signals detected during stimulation and flow tests (e.g., temperature anomalies, micro-earthquake events, etc.) are also compiled in the database. All feature locations are reported using the local Homestake Mine coordinate system. In this paper, we present some of the geostructural characteristics as well as the status of the testbed as represented by Leapfrog/FracMan database/visualizations.

15 GEOTHERMAL ENERGY↗

A lock-free priority queue design based on multi-dimensional linked lists

The throughput of concurrent priority queues is pivotal to multiprocessor applications such as discrete event simulation, best-first search and task scheduling. Existing lock-free priority queues are mostly based on skiplists, which probabilistically create shortcuts in an ordered list for fast insertion of elements. The use of skiplists eliminates the need of global rebalancing in balanced search trees and ensures logarithmic sequential search time on average, but the worst-case performance is linear with respect to the input size. In this paper, we propose a quiescently consistent lock-free priority queue based on a multi-dimensional list that guarantees worst-case search time of O(logN) for key universe of size N. The novel multi-dimensional list (MDList) is composed of nodes that contain multiple links to child nodes arranged by their dimensionality. The insertion operation works by first injectively mapping the scalar key to a high-dimensional vector, then uniquely locating the target position by using the vector as coordinates. Nodes in MDList are ordered by their coordinate prefixes and the ordering property of the data structure is readily maintained during insertion without rebalancing nor randomization. Furthermore, in our experimental evaluation using a micro-benchmark, our priority queue achieves an average of 50% speedup over the state of the art approaches under high concurrency.

97 MATHEMATICS AND COMPUTING↗