PADDED STRING - TREATING STRING AS SEQUENCE OF MACHINE WORDS
| dc.citation.epage | 67 | en_US |
| dc.citation.issue | 9 | en_US |
| dc.citation.spage | 64 | en_US |
| dc.citation.volume | 29 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | WU, PC | en_US |
| dc.contributor.author | WANG, FJ | en_US |
| dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
| dc.contributor.department | Institute of Computer Science and Engineering | en_US |
| dc.date.accessioned | 2014-12-08T15:03:49Z | |
| dc.date.available | 2014-12-08T15:03:49Z | |
| dc.date.issued | 1994-09-01 | en_US |
| dc.description.abstract | A string is a sequence of characters. The operations such as copy and comparison on strings are usually performed character by character. This note presents a data type called padded string, a string type with faster operations. A padded string is a sequence of machine words. For 32-bit machines, four characters can be operated in one machine instruction. Operations on padded strings can then run faster than traditional strings such as char* in C language. An experiment sorting an array of strings shows speedup 24% using padded string. | en_US |
| dc.identifier.issn | 0362-1340 | en_US |
| dc.identifier.journal | SIGPLAN NOTICES | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/2356 | |
| dc.identifier.wosnumber | WOS:A1994PD32000009 | |
| dc.language.iso | en_US | en_US |
| dc.subject | STRING | en_US |
| dc.subject | DATA STRUCTURE | en_US |
| dc.subject | STRING SORTING | en_US |
| dc.title | PADDED STRING - TREATING STRING AS SEQUENCE OF MACHINE WORDS | en_US |
| dc.type | Article | en_US |