SISTEMA DE ADMINISTRACION DE MEMORIA DE UN SISTEMA DE ORDENADOR
LA INVENCION SE REFIERE A UN SISTEMA DE ADMINISTRACION DE MEMORIA DE SISTEMA DE ORDENADOR, EN PARTICULAR SISTEMA EN TIEMPO REAL, QUE DEBE PERMITIR CORTOS TIEMPOS DE ACCESO SOBRE LA MEMORIA LIBRE, SIN QUE SE MENOSCABE LA SEGURIDAD DE DATOS Y LA DISPONIBILIDAD. ESTE OBJETIVO SE CONSIGUE POR MEDIO DE U...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | spa |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | LUKAS, KIRK SOMMER HERHARD KRUSCHE, STEFAN DR.Y |
| description | LA INVENCION SE REFIERE A UN SISTEMA DE ADMINISTRACION DE MEMORIA DE SISTEMA DE ORDENADOR, EN PARTICULAR SISTEMA EN TIEMPO REAL, QUE DEBE PERMITIR CORTOS TIEMPOS DE ACCESO SOBRE LA MEMORIA LIBRE, SIN QUE SE MENOSCABE LA SEGURIDAD DE DATOS Y LA DISPONIBILIDAD. ESTE OBJETIVO SE CONSIGUE POR MEDIO DE UNA ESTRUCTURA (RIT) DE ADMINISTRACION DE LA MEMORIA LIBRE, QUE ABARCA DE ACUERDO CON LA INVENCION UNA ESTRUCTURA DE ARBOL ESTATICA.
The memory management system uses a management structure(RIT) allowing the free memory capacity to be managed in blocks. The management structure is provided as a static tree structure with the memory blocks arranged at the leaf nodes. Pref. the free memory capacity is divided into blocks of fixed length, with statically defined block lengths, each block of given length positioned at a leaf node. The tree structure can be divided into hierarchy planes, with the lowest hierarchy plane divided into discrete block lengths. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_ES2176214TT3</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ES2176214TT3</sourcerecordid><originalsourceid>FETCH-epo_espacenet_ES2176214TT33</originalsourceid><addsrcrecordid>eNrjZLAP9gwOcfV1VHBxVXB08fX0A3KDHJ09_f1AIr6uvv5BnmDJUD8FJKX-QS6ufo4u_kE8DKxpiTnFqbxQmptB0c01xNlDN7UgPz61uCAxOTUvtSTeNdjI0NzMyNAkJMTYmBg1AFzjKmY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SISTEMA DE ADMINISTRACION DE MEMORIA DE UN SISTEMA DE ORDENADOR</title><source>esp@cenet</source><creator>LUKAS, KIRK ; SOMMER HERHARD ; KRUSCHE, STEFAN DR.Y</creator><creatorcontrib>LUKAS, KIRK ; SOMMER HERHARD ; KRUSCHE, STEFAN DR.Y</creatorcontrib><description>LA INVENCION SE REFIERE A UN SISTEMA DE ADMINISTRACION DE MEMORIA DE SISTEMA DE ORDENADOR, EN PARTICULAR SISTEMA EN TIEMPO REAL, QUE DEBE PERMITIR CORTOS TIEMPOS DE ACCESO SOBRE LA MEMORIA LIBRE, SIN QUE SE MENOSCABE LA SEGURIDAD DE DATOS Y LA DISPONIBILIDAD. ESTE OBJETIVO SE CONSIGUE POR MEDIO DE UNA ESTRUCTURA (RIT) DE ADMINISTRACION DE LA MEMORIA LIBRE, QUE ABARCA DE ACUERDO CON LA INVENCION UNA ESTRUCTURA DE ARBOL ESTATICA.
The memory management system uses a management structure(RIT) allowing the free memory capacity to be managed in blocks. The management structure is provided as a static tree structure with the memory blocks arranged at the leaf nodes. Pref. the free memory capacity is divided into blocks of fixed length, with statically defined block lengths, each block of given length positioned at a leaf node. The tree structure can be divided into hierarchy planes, with the lowest hierarchy plane divided into discrete block lengths.</description><edition>7</edition><language>spa</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2002</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20021201&DB=EPODOC&CC=ES&NR=2176214T3$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20021201&DB=EPODOC&CC=ES&NR=2176214T3$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LUKAS, KIRK</creatorcontrib><creatorcontrib>SOMMER HERHARD</creatorcontrib><creatorcontrib>KRUSCHE, STEFAN DR.Y</creatorcontrib><title>SISTEMA DE ADMINISTRACION DE MEMORIA DE UN SISTEMA DE ORDENADOR</title><description>LA INVENCION SE REFIERE A UN SISTEMA DE ADMINISTRACION DE MEMORIA DE SISTEMA DE ORDENADOR, EN PARTICULAR SISTEMA EN TIEMPO REAL, QUE DEBE PERMITIR CORTOS TIEMPOS DE ACCESO SOBRE LA MEMORIA LIBRE, SIN QUE SE MENOSCABE LA SEGURIDAD DE DATOS Y LA DISPONIBILIDAD. ESTE OBJETIVO SE CONSIGUE POR MEDIO DE UNA ESTRUCTURA (RIT) DE ADMINISTRACION DE LA MEMORIA LIBRE, QUE ABARCA DE ACUERDO CON LA INVENCION UNA ESTRUCTURA DE ARBOL ESTATICA.
The memory management system uses a management structure(RIT) allowing the free memory capacity to be managed in blocks. The management structure is provided as a static tree structure with the memory blocks arranged at the leaf nodes. Pref. the free memory capacity is divided into blocks of fixed length, with statically defined block lengths, each block of given length positioned at a leaf node. The tree structure can be divided into hierarchy planes, with the lowest hierarchy plane divided into discrete block lengths.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2002</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLAP9gwOcfV1VHBxVXB08fX0A3KDHJ09_f1AIr6uvv5BnmDJUD8FJKX-QS6ufo4u_kE8DKxpiTnFqbxQmptB0c01xNlDN7UgPz61uCAxOTUvtSTeNdjI0NzMyNAkJMTYmBg1AFzjKmY</recordid><startdate>20021201</startdate><enddate>20021201</enddate><creator>LUKAS, KIRK</creator><creator>SOMMER HERHARD</creator><creator>KRUSCHE, STEFAN DR.Y</creator><scope>EVB</scope></search><sort><creationdate>20021201</creationdate><title>SISTEMA DE ADMINISTRACION DE MEMORIA DE UN SISTEMA DE ORDENADOR</title><author>LUKAS, KIRK ; SOMMER HERHARD ; KRUSCHE, STEFAN DR.Y</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_ES2176214TT33</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>spa</language><creationdate>2002</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>LUKAS, KIRK</creatorcontrib><creatorcontrib>SOMMER HERHARD</creatorcontrib><creatorcontrib>KRUSCHE, STEFAN DR.Y</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LUKAS, KIRK</au><au>SOMMER HERHARD</au><au>KRUSCHE, STEFAN DR.Y</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SISTEMA DE ADMINISTRACION DE MEMORIA DE UN SISTEMA DE ORDENADOR</title><date>2002-12-01</date><risdate>2002</risdate><abstract>LA INVENCION SE REFIERE A UN SISTEMA DE ADMINISTRACION DE MEMORIA DE SISTEMA DE ORDENADOR, EN PARTICULAR SISTEMA EN TIEMPO REAL, QUE DEBE PERMITIR CORTOS TIEMPOS DE ACCESO SOBRE LA MEMORIA LIBRE, SIN QUE SE MENOSCABE LA SEGURIDAD DE DATOS Y LA DISPONIBILIDAD. ESTE OBJETIVO SE CONSIGUE POR MEDIO DE UNA ESTRUCTURA (RIT) DE ADMINISTRACION DE LA MEMORIA LIBRE, QUE ABARCA DE ACUERDO CON LA INVENCION UNA ESTRUCTURA DE ARBOL ESTATICA.
The memory management system uses a management structure(RIT) allowing the free memory capacity to be managed in blocks. The management structure is provided as a static tree structure with the memory blocks arranged at the leaf nodes. Pref. the free memory capacity is divided into blocks of fixed length, with statically defined block lengths, each block of given length positioned at a leaf node. The tree structure can be divided into hierarchy planes, with the lowest hierarchy plane divided into discrete block lengths.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | spa |
| recordid | cdi_epo_espacenet_ES2176214TT3 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | SISTEMA DE ADMINISTRACION DE MEMORIA DE UN SISTEMA DE ORDENADOR |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T00%3A05%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=LUKAS,%20KIRK&rft.date=2002-12-01&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EES2176214TT3%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |