Geometric Algorithms for Private-Cache Chip Multiprocessors

Files in This Item:
File Description SizeFormat 
ajwani_esa10.pdf175.18 kBAdobe PDFDownload
Title: Geometric Algorithms for Private-Cache Chip Multiprocessors
Authors: Ajwani, Deepak
Sitchinava, Nodari
Zeh, Norbert
Permanent link:
Date: 8-Sep-2010
Online since: 2019-04-11T08:17:59Z
Abstract: We study techniques for obtaining efficient algorithms for geometric problems on private-cache chip multiprocessors.
Type of material: Conference Publication
Publisher: Springer
Start page: 75
End page: 86
Series/Report no.: Lecture Notes in Computer Science (LNCS. volume 6347)
Copyright (published version): 2010 Springer
Keywords: Shared memoryVertical segmentHorizontal segmentLower envelopeIntersection count
DOI: 10.1007/978-3-642-15781-3_7
Language: en
Status of Item: Peer reviewed
Is part of: de Berg, M., Meyer, U. (eds.). Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II
Conference Details: The 18th Annual European Symposium (ESA 2010), Liverpool, United Kingdom, 6-8 September 2010
ISBN: 978-3-642-15780-6
Appears in Collections:Computer Science Research Collection

Show full item record

Citations 20

Last Week
Last month
checked on May 19, 2019

Google ScholarTM



This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.