View in EDS PDF Full Text

A faster, all parallel Merge sort algorithm for multicore processors.

Saved in:
Bibliographic Details
Title: A faster, all parallel Merge sort algorithm for multicore processors.
Authors: Maus, Arne1, arnem@ifi.uio.no
Source: Norsk Informatikkonferanse; 2018, p1-11, 11p
Database: Applied Science & Technology Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 133230656
AccessLevel: 2
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A faster, all parallel Merge sort algorithm for multicore processors.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Maus%2C+Arne%22">Maus, Arne</searchLink><relatesTo>1</relatesTo>, <i>arnem@ifi.uio.no</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Norsk+Informatikkonferanse%22">Norsk Informatikkonferanse</searchLink>; 2018, p1-11, 11p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=133230656
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 1
    Titles:
      – TitleFull: A faster, all parallel Merge sort algorithm for multicore processors.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Maus, Arne
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: 2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 18920713
          Titles:
            – TitleFull: Norsk Informatikkonferanse
              Type: main
ResultId 1