Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2007-12-14 16:50
An improvement of cuncurrent extensible hash tables to reduce contension costs
Naoya Sueda, Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) COMP2007-54
Abstract (in Japanese) (See Japanese page) 
(in English) We improve the split-ordered list hash algorithm(SOL) proposed by
Shalev and Nir that can process multiple operations concurently and
can extend teble size on asynchronous shared memory systems. In
general hashing algorithm, lists bucket are longer as the number of
items inserted in the hash table is larger. Consequently, it is
problem that time of searching item is larger. SOL algorithm,
maintains constant length of bucket lists by extending table
size. Time of find operation is faster when SOL algorthm executed by
multiple operation. On concurrent execution, however, SOL algorithm
might have significant performance degradation when many instructions
for insertion and deletion areissued concurrently. We consider that
the performance degradation is introduced by concurrent accessing one
shared variable. We focus on contention for one shared variable. We
propose an improvement of SOL algorithm to avoid access contention and
aim high-performance hashing algorithm.
Keyword (in Japanese) (See Japanese page) 
(in English) asynchronous shared memory system / shared variable / concurrent execution / extensible hash tables / $compare$-$and$-$swap$ instruction / / /  
Reference Info. IEICE Tech. Rep., vol. 107, no. 390, COMP2007-54, pp. 43-50, Dec. 2007.
Paper # COMP2007-54 
Date of Issue 2007-12-07 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2007-54

Conference Information
Committee COMP  
Conference Date 2007-12-14 - 2007-12-14 
Place (in Japanese) (See Japanese page) 
Place (in English) Hiroshima University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2007-12-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An improvement of cuncurrent extensible hash tables to reduce contension costs 
Sub Title (in English)  
Keyword(1) asynchronous shared memory system  
Keyword(2) shared variable  
Keyword(3) concurrent execution  
Keyword(4) extensible hash tables  
Keyword(5) $compare$-$and$-$swap$ instruction  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Naoya Sueda  
1st Author's Affiliation Hiroshima City University (Hiroshima City Univ.)
2nd Author's Name Yoko Kamidoi  
2nd Author's Affiliation Hiroshima City University (Hiroshima City Univ.)
3rd Author's Name Shin'ichi Wakabayashi  
3rd Author's Affiliation Hiroshima City University (Hiroshima City Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2007-12-14 16:50:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2007-54 
Volume (vol) vol.107 
Number (no) no.390 
Page pp.43-50 
#Pages 8 
Date of Issue 2007-12-07 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan