Management of destage tasks with large number of ranks
A processor, operable in a computing storage environment, for each rank in a storage management device in the computing storage environment, allocates a lower maximum count defined by a predetermined lower maximum count of Task Control Blocks (TCBs) of a rank for performing destage operations, and a...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Patent |
Sprache: | eng |
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 | Todd Kenneth Wayne Gupta Lokesh Mohan Ash Kevin John Benhase Michael Thomas |
description | A processor, operable in a computing storage environment, for each rank in a storage management device in the computing storage environment, allocates a lower maximum count defined by a predetermined lower maximum count of Task Control Blocks (TCBs) of a rank for performing destage operations, and a higher maximum count of TCBs to be implemented for performing a storage operation, and performs the storage operation using up to the lower maximum count of TCBs, yet only allows those TCBs above the lower maximum count to be allocated for performing the storage operation satisfying at least one criterion. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9626113B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9626113B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9626113B23</originalsourceid><addsrcrecordid>eNrjZDDzTcxLTE_NTc0rUchPU0hJLS4BchVKEouzixXKM0syFHISi4ACeaW5SalFICVFiXnZxTwMrGmJOcWpvFCam0HBzTXE2UM3tSA_PrW4IDE5NS-1JD402NLMyMzQ0NjJyJgIJQAnrC0A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Management of destage tasks with large number of ranks</title><source>esp@cenet</source><creator>Todd Kenneth Wayne ; Gupta Lokesh Mohan ; Ash Kevin John ; Benhase Michael Thomas</creator><creatorcontrib>Todd Kenneth Wayne ; Gupta Lokesh Mohan ; Ash Kevin John ; Benhase Michael Thomas</creatorcontrib><description>A processor, operable in a computing storage environment, for each rank in a storage management device in the computing storage environment, allocates a lower maximum count defined by a predetermined lower maximum count of Task Control Blocks (TCBs) of a rank for performing destage operations, and a higher maximum count of TCBs to be implemented for performing a storage operation, and performs the storage operation using up to the lower maximum count of TCBs, yet only allows those TCBs above the lower maximum count to be allocated for performing the storage operation satisfying at least one criterion.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2017</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=20170418&DB=EPODOC&CC=US&NR=9626113B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20170418&DB=EPODOC&CC=US&NR=9626113B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Todd Kenneth Wayne</creatorcontrib><creatorcontrib>Gupta Lokesh Mohan</creatorcontrib><creatorcontrib>Ash Kevin John</creatorcontrib><creatorcontrib>Benhase Michael Thomas</creatorcontrib><title>Management of destage tasks with large number of ranks</title><description>A processor, operable in a computing storage environment, for each rank in a storage management device in the computing storage environment, allocates a lower maximum count defined by a predetermined lower maximum count of Task Control Blocks (TCBs) of a rank for performing destage operations, and a higher maximum count of TCBs to be implemented for performing a storage operation, and performs the storage operation using up to the lower maximum count of TCBs, yet only allows those TCBs above the lower maximum count to be allocated for performing the storage operation satisfying at least one criterion.</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>2017</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDDzTcxLTE_NTc0rUchPU0hJLS4BchVKEouzixXKM0syFHISi4ACeaW5SalFICVFiXnZxTwMrGmJOcWpvFCam0HBzTXE2UM3tSA_PrW4IDE5NS-1JD402NLMyMzQ0NjJyJgIJQAnrC0A</recordid><startdate>20170418</startdate><enddate>20170418</enddate><creator>Todd Kenneth Wayne</creator><creator>Gupta Lokesh Mohan</creator><creator>Ash Kevin John</creator><creator>Benhase Michael Thomas</creator><scope>EVB</scope></search><sort><creationdate>20170418</creationdate><title>Management of destage tasks with large number of ranks</title><author>Todd Kenneth Wayne ; Gupta Lokesh Mohan ; Ash Kevin John ; Benhase Michael Thomas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9626113B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2017</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Todd Kenneth Wayne</creatorcontrib><creatorcontrib>Gupta Lokesh Mohan</creatorcontrib><creatorcontrib>Ash Kevin John</creatorcontrib><creatorcontrib>Benhase Michael Thomas</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Todd Kenneth Wayne</au><au>Gupta Lokesh Mohan</au><au>Ash Kevin John</au><au>Benhase Michael Thomas</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Management of destage tasks with large number of ranks</title><date>2017-04-18</date><risdate>2017</risdate><abstract>A processor, operable in a computing storage environment, for each rank in a storage management device in the computing storage environment, allocates a lower maximum count defined by a predetermined lower maximum count of Task Control Blocks (TCBs) of a rank for performing destage operations, and a higher maximum count of TCBs to be implemented for performing a storage operation, and performs the storage operation using up to the lower maximum count of TCBs, yet only allows those TCBs above the lower maximum count to be allocated for performing the storage operation satisfying at least one criterion.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_US9626113B2 |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
title | Management of destage tasks with large number of ranks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T12%3A04%3A15IST&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=Todd%20Kenneth%20Wayne&rft.date=2017-04-18&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9626113B2%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 |