Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
Current Result Document : 1 / 5
ÇѱÛÁ¦¸ñ(Korean Title) |
¹®¸ÆÀÚÀ¯ ¹®¹ýÀ» À§ÇÑ º´·Ä ÆÄ½Ì ¾Ë°í¸®ÁòÀÇ ¼³°è ¹× ¼º´É ºÐ¼® |
¿µ¹®Á¦¸ñ(English Title) |
Design and Performance Analysis of a Parallel Algorithm for Context-Free Grammars |
ÀúÀÚ(Author) |
³ªµ¿·Ä
ÀÌÁøÈ£
±èÁ¾Çö
Dongyul Ra
Jinho Lee
Jonghyun Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 23 NO. 09 PP. 0972 ~ 0981 (1996. 09) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â ÀϹÝÀûÀÎ ¹®¸Æ ÀÚÀ¯ ¾ð¾î(Context-Free Language; CFL)¸¦ ÀνÄÇÏ°í ÆĽÌÇϱâ À§ÇÑ º´·Ä ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ÀÌ ¾Ë°í¸®ÁòÀº ÇÏÀÌÆÛÅ¥ºê¿Í °°Àº ¼Ò°áÇÕ ´ÙÁßÇÁ·Î¼¼¼ ½Ã½ºÅÛ(loosely-coupled multiprocessor system)¿¡ ÀûÇÕÇϵµ·Ï ¼³°èµÇ¾ú´Ù. À̸¦ À§ÇÑ ½Ã½ºÅÛ ±¸Á¶´Â °£´ÜÇÑ ¸µ(ring) ±¸Á¶ÀÌ¸é µÇ¸ç, nÀ» ÀԷ½ºÆ®¸µÀÇ ±æÀ̶ó ÇÒ¶§ ÇÁ·Î¼¼¼ÀÇ ¼ö p´Â nÀÌÇÏÀÇ ÀÓÀÇÀÇ ¼öÀÌ¸é µÈ´Ù( Áï, 1¡Âp¡Ân ). ºÐ¼®°á°ú¿¡ µû¸£¸é Á¦¾ÈÇÑ º´·Ä ¾Ë°í¸®ÁòÀÇ ½Ã°£ º¹Àâµµ(time complexity)´Â ÃÖ¾ÇÀÇ °æ¿ì¿¡ O(n©ø/p) ÀÎ °ÍÀ¸·Î ³ªÅ¸³µ´Ù. ÀÌ ¾Ë°í¸®ÁòÀº EarleyÀÇ ¾Ë°í¸®Áò¿¡ ±â¹ÝÀ» µÎ°í Àֱ⠶§¹®¿¡ ÀÓÀÇÀÇ ¹®¸Æ ÀÚÀ¯ ¹®¹ý(Context-Free Grammar; CFG)¿¡ ´ëÇÏ¿© Àû¿ëµÉ ¼ö ÀÖ´Ù. ÀÌ ¾Ë°í¸®ÁòÀº °£´ÜÇÑ ÀÛ¾÷ ¹èÄ¡ ¹æ¹ýÀ» ÀÌ¿ëÇÏ¿´À½¿¡µµ ³ôÀº ¼º´É Çâ»óÀ» ¾òÀ» ¼ö ÀÖ¾ú´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
In this paper, a parallel algorithm is given for recognizing and parsing arbitrary context-free language. The algorithm operates on multiprocessor systems with loosely-coupled architectures including hypercubes. The requirement on the architecture is simple : The processors need to form just a one-way ring. The requirement on p, the number of processors used, is also flexible: any p satisfying 1¡Âp¡Ân (where n is the length of the input string). The analysis show that the algorithm operates in O(n©ø/p) time in the worst case. This is the optimal performance one can get with the given architecture. Our parallel algorithm is based on Earley's algorithm and thus it can be used for arbitrary context-free grammars. High performance was achieved with a simple job allocation strategy.
|
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|