Parallelizing the OPS5 matching algorithm in Qlisp:
Abstract: "In recent years, production systems have become a popular framework within which to implement large-scale expert systems. Unfortunately, production systems are often characterized by slow running times, because of the large amount of matching that must be done during their execution....
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1991
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1396 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In recent years, production systems have become a popular framework within which to implement large-scale expert systems. Unfortunately, production systems are often characterized by slow running times, because of the large amount of matching that must be done during their execution. For the production system language OPS5, there is a highly efficient matching algorithm known as the Rete algorithm which gives a large speedup over a naive implementation of production systems. In this paper, we describe our attempts to speed up OPS5 even further by parallelizing the Rete algorithm in Qlisp, a parallel Lisp language. We give details on the Qlisp constructs we used to parallelize the Rete algorithm and provide actual timing results on various OPS5 rule sets." |
| Beschreibung: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992847 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25958483 | ||
| 035 | |a (DE-599)BVBBV008992847 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Scales, Daniel J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallelizing the OPS5 matching algorithm in Qlisp |c by Daniel J. Scales |
| 264 | 1 | |a Stanford, Calif. |c 1991 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1396 | |
| 520 | 3 | |a Abstract: "In recent years, production systems have become a popular framework within which to implement large-scale expert systems. Unfortunately, production systems are often characterized by slow running times, because of the large amount of matching that must be done during their execution. For the production system language OPS5, there is a highly efficient matching algorithm known as the Rete algorithm which gives a large speedup over a naive implementation of production systems. In this paper, we describe our attempts to speed up OPS5 even further by parallelizing the Rete algorithm in Qlisp, a parallel Lisp language. We give details on the Qlisp constructs we used to parallelize the Rete algorithm and provide actual timing results on various OPS5 rule sets." | |
| 650 | 4 | |a Large scale systems | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1396 |w (DE-604)BV008928280 |9 1396 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941765 | ||
Datensatz im Suchindex
| _version_ | 1804123335367327744 |
|---|---|
| any_adam_object | |
| author | Scales, Daniel J. |
| author_facet | Scales, Daniel J. |
| author_role | aut |
| author_sort | Scales, Daniel J. |
| author_variant | d j s dj djs |
| building | Verbundindex |
| bvnumber | BV008992847 |
| ctrlnum | (OCoLC)25958483 (DE-599)BVBBV008992847 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01745nam a2200301 cb4500</leader><controlfield tag="001">BV008992847</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25958483</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992847</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Scales, Daniel J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallelizing the OPS5 matching algorithm in Qlisp</subfield><subfield code="c">by Daniel J. Scales</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1396</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In recent years, production systems have become a popular framework within which to implement large-scale expert systems. Unfortunately, production systems are often characterized by slow running times, because of the large amount of matching that must be done during their execution. For the production system language OPS5, there is a highly efficient matching algorithm known as the Rete algorithm which gives a large speedup over a naive implementation of production systems. In this paper, we describe our attempts to speed up OPS5 even further by parallelizing the Rete algorithm in Qlisp, a parallel Lisp language. We give details on the Qlisp constructs we used to parallelize the Rete algorithm and provide actual timing results on various OPS5 rule sets."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Large scale systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1396</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1396</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941765</subfield></datafield></record></collection> |
| id | DE-604.BV008992847 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941765 |
| oclc_num | 25958483 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 20 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Scales, Daniel J. Verfasser aut Parallelizing the OPS5 matching algorithm in Qlisp by Daniel J. Scales Stanford, Calif. 1991 20 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1396 Abstract: "In recent years, production systems have become a popular framework within which to implement large-scale expert systems. Unfortunately, production systems are often characterized by slow running times, because of the large amount of matching that must be done during their execution. For the production system language OPS5, there is a highly efficient matching algorithm known as the Rete algorithm which gives a large speedup over a naive implementation of production systems. In this paper, we describe our attempts to speed up OPS5 even further by parallelizing the Rete algorithm in Qlisp, a parallel Lisp language. We give details on the Qlisp constructs we used to parallelize the Rete algorithm and provide actual timing results on various OPS5 rule sets." Large scale systems Parallel programming (Computer science) Computer Science Department: Report STAN CS Stanford University 1396 (DE-604)BV008928280 1396 |
| spellingShingle | Scales, Daniel J. Parallelizing the OPS5 matching algorithm in Qlisp Large scale systems Parallel programming (Computer science) |
| title | Parallelizing the OPS5 matching algorithm in Qlisp |
| title_auth | Parallelizing the OPS5 matching algorithm in Qlisp |
| title_exact_search | Parallelizing the OPS5 matching algorithm in Qlisp |
| title_full | Parallelizing the OPS5 matching algorithm in Qlisp by Daniel J. Scales |
| title_fullStr | Parallelizing the OPS5 matching algorithm in Qlisp by Daniel J. Scales |
| title_full_unstemmed | Parallelizing the OPS5 matching algorithm in Qlisp by Daniel J. Scales |
| title_short | Parallelizing the OPS5 matching algorithm in Qlisp |
| title_sort | parallelizing the ops5 matching algorithm in qlisp |
| topic | Large scale systems Parallel programming (Computer science) |
| topic_facet | Large scale systems Parallel programming (Computer science) |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT scalesdanielj parallelizingtheops5matchingalgorithminqlisp |