http://rdf.ncbi.nlm.nih.gov/pubchem/patent/EP-0629302-A1
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_4ddcb273a108a5d8472b335280098e06 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F12-123 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F8-4442 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-45 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F12-12 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F12-123 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F8-41 |
filingDate | 1993-02-18^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_a00dbe8a3dc17c3eb8bf0c26d8523a3c http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_98dc1a1144b2e265bbaa44e668c05b80 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_896d22c443864a11cf4db7e7770006a5 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_0e2934044ad7dd50f2b43a4705b15cc3 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_e1d4fbee6a4f6ddab4a090b6224561db |
publicationDate | 1994-12-21^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | EP-0629302-A1 |
titleOfInvention | METHOD FOR JOINING PARTS OF A PROGRAM INTO A SINGLE PROGRAM. |
abstract | The program modules or parts of a program contained in a program are combined into a single program in such a way that its duration of execution on a computer operating on the principle of the cache memory is minimal. Furthermore, a plurality of sequences of the program parts can be generated in pseudo-random manner and these sequences can be evaluated from the point of view of their execution time. The sequence of program parts which obtains the best evaluation result and which therefore has the shortest execution time is chosen as the current sequence. This current sequence of program parts makes it possible to continue the work. For this purpose, two program parts of the current sequence are selected and swapped each time in a pseudo-random manner. Then, it is again determined whether the new sequence of program parts generated by the permutation gives a better evaluation result than the current sequence of program parts. If this is the case, the new sequence becomes the current sequence, otherwise we continue with the hitherto current sequence by a repeated permutation of two parts of the program. This step is continued until a predetermined interruption criterion is satisfied, which can for example be a given number of permutations. |
priorityDate | 1992-03-02^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Predicate | Subject |
---|---|
isDiscussedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID7269 http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419517708 |
Showing number of triples: 1 to 21 of 21.