text: _.Ij.prototype.Ae=function(){var a=new gj;this.H=a;var b=_.Rh.Cb();b.kb=!0;this.R();b.Pa=a;_.mfa(b);a.Za=b;b=_.Pf("Im6cmf").Na()+"/jserror";$ha(b);b=_.Yd(_.Pf("cfb2h").Na());kj.buildLabel=b;if(Hj)for(var b=Hj.H,c=0;c<_.Gj.length;c++)b.push(_.Gj[c]);var b=window,d,c=new Ifa,e=b||window,f=e.document.documentElement,g=new Wfa(f);a:{for(var l=0;lAlbum - Google+Press question mark to see available shortcut keysSign in4 Photos - Jul 1, 2011

type: global

value: This website .


text:
Latest News for: national system
that that vessel or persons on those vessels may in fact be doing harm to our systems," Rommal said. "And that affects the national economy and affects the entire United States." ... "And when those systems are compromised, it doesn't just affect Louisiana. It affects the entire nation." ... FBI statistics show some 41,000 victims lost $2.9 billion to cyber-thieves nationally from October 2013 to May 2018, Ramey said....
New Jersey’s nation-leading bail reform is looking stronger at the 20-month mark ... More challenges are forming and important data that details its effects aren’t available yet, but the bail reform trend seems to have taken root nationally ... 1, 2017, the bipartisan reform all but eliminated money bail as the determinant of whether a defendant would be released pending trial or held — a system that obviously favored those with more money....
Findings were consolidated into NG911 “What’s Next?” Final Report of recommendations to the US DOT to help form the basis for national priority emergency responder information protocols associated with NG911 systems ... The National 9-1-1 Program works with states, technology providers, public safety officials, and 9-1-1 professionals ......
Heather Dean used to be a financial systems expert, but now she's a personal trainer ... One in three students is not a Swiss national and even more are born into dual nationality families ... system....
NFSA guarantees provision of subsidised ration through the Public Distribution System to about two-thirds of the nation's population for which the state governments are supposed to frame and notify rules and implement them ... System (PDS) National Food Security Act (NFSA) grievance redressal mechanism Food Commission starvation deaths....
The committee on 'Information Systems and Technology and Cyber Security' will suggest steps to align PFRDA's technology with best industry practices ... It develops, promotes and regulates the pension industry under the National Pension System and also administers the Atal Pension Yojna....
It’s an individualistic, free market approach that was sold as a means of improving the whole system; ideology that captured the policy direction of the Howard government in the 1990s ... Nationally about 65% of Australian students are in the public system, but that drops to about 60% in high school, and in cities such as Melbourne and Sydney, close to half of secondary students go to private schools....
Glens Falls Hospital has installed a “visitor management system” designed to improve security ... What we found out was that a visitor management system refers to tracking the usage of a public building or site by gathering increasing amounts of information ... Some schools have experimented with the system to protect children from sexual predators by checking visitor information against national and local criminal databases....
A “silent crisis” in the care system has left more than 13,000 children with unacceptable levels of support from local authorities, an analysis warns ... Anne Longfield, the children’s commissioner for England, said the findings cast “a stark spotlight on the inadequacies of systems that are meant to be in place to support our most vulnerable children” ... The national average is 55%....
A firm handshake was what Sen ... Lacson said the occasion came last May when he and Arroyo sat down as members of the bicameral conference committee that was trying to reconcile the Senate and House versions of the national identification (ID) system ... After the committee came up with a common version of the national ID, its members took a group photo to mark the occasion. "(Arroyo) came forward,... ....
Abdullah Al-Kaabi of the state-run Qatar National Human Rights Committee said Saudi Arabia had shut down an electronic system used by travel agencies to obtain permits for pilgrims from Qatar....
The document says Papadopoulos had a series of communications over a period of months with the professor, a female Russian national, and a Russia foreign ministry connection "in which they discussed arranging a meeting between Russian officials and the Trump campaign." ... political system primarily by manipulating social media platforms....
Nationalism, isolationism, xenophobia and protectionism is the name of the game ... Populist strong men (and women) are playing on the fears and anger of the left behind and the use of nationalism as a tool of control of the masses essentially creates a dichotomy between ancient feelings of communal loyalty and our modem democratic systems of popular sovereignty - of the people and for the people ... Nation states are arbitrary units....

value: This website is a news aggregator founded in March 1995 and launched online in 1998. In 2003, Search Engine Watch praised the service for its "Special Reports", and called it "an interesting alternative" to other news aggregation services.


text:
The effect of body mass index on therapeutic ... [Am J Perinatol. 2008] - PubMed - NCBI
Display Settings:AbstractFormatSummarySummary (text)AbstractAbstract (text)MEDLINEXMLPMID ListApplySend to:Choose DestinationFileClipboardCollectionsE-mailOrderMy BibliographyCitation managerFormatSummary (text)Abstract (text)MEDLINEXMLPMID ListCSVCreate File1 selected item: 18548397FormatSummarySummary (text)AbstractAbstract (text)MEDLINEXMLPMID ListMeSH and Other DataE-mailSubjectAdditional textE-mail"SPAM" filtering software noticeAdd to ClipboardAdd to CollectionsOrder articlesAdd to My BibliographyGenerate a file for use with external citation management software.Create File
See comment in PubMed Commons belowAm J Perinatol. 2008 Apr;25(4):233-7. doi: 10.1055/s-2008-1066875.The effect of body mass index on therapeutic response to bacterial vaginosis in pregnancy.Mastrobattista JM1, Klebanoff MA, Carey JC, Hauth JC, Macpherson CA, Ernest J, Cotroneo M, Leveno KJ, Wapner R, Varner M, Iams JD, Moawad A, Sibai BM, Miodovnik M, Dombrowski M, O'Sullivan MJ, Vandorsten JP, Langer O; National Institute of Child Health and Human Development Maternal-Fetal Medicine Unit Networks.Collaborators (44)Copper RL, Andrews WW, Jones P, Lindheimer MD, Elder N, Siddiqi TA, Thom E, Leindecker S, Fischer ML, Phillip Heine R, Caritis SN, Kamon T, Roberts J, Beydoun S, Alfonso C, Doyle F, McNellis D, Catz C, Yaffe SJ, Trout W, Johnson F, Landon MB, Thurnau G, Meier A, Collins BA, LeBoeuf F, Newman RB, Mercer BM, Ramsey R, Berkus M, Nicholson S, Sherman ML, Bloom S, DiVito M, Tolosa J, Dudley D, Reynolds L, Meis P, Mueller-Heubach E, Swain M, Bottoms SF, Norman GS, Hillier SL, Nugent RP.Author information 1Department of Obstetrics, Gynecology and Reproductive Sciences, The University of Texas Medical School at Houston, Houston, Texas 77030, USA.AbstractOur objective was to determine the effect of body mass index (BMI) on response to bacterial vaginosis (BV) treatment. A secondary analysis was conducted of two multicenter trials of therapy for BV and TRICHOMONAS VAGINALIS. Gravida were screened for BV between 8 and 22 weeks and randomized between 16 and 23 weeks to metronidazole or placebo. Of 1497 gravida with asymptomatic BV and preconceptional BMI, 738 were randomized to metronidazole; BMI was divided into categories: < 25, 25 to 29.9, and > or = 30. Rates of BV persistence at follow-up were compared using the Mantel-Haenszel chi square. Multiple logistic regression was used to evaluate the effect of BMI on BV persistence at follow-up, adjusting for potential confounders. No association was identified between BMI and BV rate at follow-up ( P = 0.21). BMI was associated with maternal age, smoking, marital status, and black race. Compared with women with BMI of < 25, adjusted odds ratio (OR) of BV at follow-up were BMI 25 to 29.9: OR, 0.66, 95% CI 0.43 to 1.02; BMI > or = 30: OR, 0.83, 95% CI 0.54 to 1.26. We concluded that the persistence of BV after treatment was not related to BMI.PMID: 18548397 [PubMed - indexed for MEDLINE] PMCID: PMC2841559 Free PMC ArticleShareImages from this publication.See all images (1)Free textFigure 1Persistence of BV at follow up by BMI categoryThe Effect of Body-Mass Index on Therapeutic Response to Bacterial Vaginosis in PregnancyAm J Perinatol. ;25(4):233-237.Publication Types, MeSH Terms, Substances, Grant SupportPublication TypesResearch Support, N.I.H., ExtramuralMeSH TermsAdultAntiprotozoal Agents/therapeutic useBody Mass Index*FemaleHumansMetronidazole/therapeutic useObesity, Morbid/complicationsOverweight/complicationsPregnancyPregnancy ComplicationsPregnancy Complications, Infectious/drug therapy*Randomized Controlled Trials as TopicTreatment OutcomeTrichomonas Vaginitis/drug therapy*SubstancesAntiprotozoal AgentsMetronidazoleGrant SupportAI38514/AI/NIAID NIH HHS/United StatesHD19897/HD/NICHD NIH HHS/United StatesHD21410/HD/NICHD NIH HHS/United StatesHD21414/HD/NICHD NIH HHS/United StatesHD27860/HD/NICHD NIH HHS/United StatesHD27861/HD/NICHD NIH HHS/United StatesHD27869/HD/NICHD NIH HHS/United StatesHD27883/HD/NICHD NIH HHS/United StatesHD27889/HD/NICHD NIH HHS/United StatesHD27905/HD/NICHD NIH HHS/United StatesHD27915/HD/NICHD NIH HHS/United StatesHD27917/HD/NICHD NIH HHS/United StatesHD34116/HD/NICHD NIH HHS/United StatesHD34122/HD/NICHD NIH HHS/United StatesHD34136/HD/NICHD NIH HHS/United StatesHD34208/HD/NICHD NIH HHS/United StatesHD34210/HD/NICHD NIH HHS/United StatesHD36801/HD/NICHD NIH HHS/United StatesU01 HD019897-130001/HD/NICHD NIH HHS/United StatesU10 HD021410/HD/NICHD NIH HHS/United StatesU10 HD021410-22/HD/NICHD NIH HHS/United StatesU10 HD021414-15/HD/NICHD NIH HHS/United StatesU10 HD027860-15/HD/NICHD NIH HHS/United StatesU10 HD027861-10/HD/NICHD NIH HHS/United StatesU10 HD027869-10/HD/NICHD NIH HHS/United StatesU10 HD027883-06/HD/NICHD NIH HHS/United StatesU10 HD027905-10/HD/NICHD NIH HHS/United StatesU10 HD027915-18/HD/NICHD NIH HHS/United StatesU10 HD027917-18/HD/NICHD NIH HHS/United StatesU10 HD034116-13/HD/NICHD NIH HHS/United StatesU10 HD034122-05/HD/NICHD NIH HHS/United StatesU10 HD034136-10/HD/NICHD NIH HHS/United StatesU10 HD034208-12/HD/NICHD NIH HHS/United StatesU10 HD034210-05/HD/NICHD NIH HHS/United StatesU10 HD036801/HD/NICHD NIH HHS/United StatesU10 HD036801-11/HD/NICHD NIH HHS/United StatesLinkOut - more resourcesFull Text SourcesGeorg Thieme Verlag Stuttgart, New YorkEurope PubMed Central - Author ManuscriptOvid Technologies, Inc.PubMed Central - Author ManuscriptPubMed Central Canada - Author ManuscriptOther Literature SourcesCOS Scholar UniverseAccess more work from the authors - ResearchGateMedicalPregnancy - Genetic AllianceInfections and Pregnancy - MedlinePlus Health InformationTrichomoniasis - MedlinePlus Health InformationMolecular Biology DatabasesMETRONIDAZOLE - HSDBPubMed Commons home

value: This website is part of the United States National Library of Medicine , a branch of the National Institutes of Health . It is approved and funded by the government of the United States.


text:
Days Inn Boerne: 2018 Room Prices, Deals & Reviews | Expedia
Days Inn Boerne, San Antonio Days Inn Boerne, San Antonio, current page
Map IH 10 W Highway 46 Boerne TX 1-855-799-6859
Situated in Boerne, this motel is within 6 mi (10 km) of Dienger Building, River Road Park, and Boerne City Park. Cibolo Nature Center and Boerne Visitors Center are also within 9 mi (15 km).
This motel features an outdoor pool, a business center, and laundry facilities. Free continental breakfast, free WiFi in public areas, and free self parking are also provided. Other amenities include a computer station.
35150 IH 10 W Highway 46 Boerne TX 78006
A computer station is located on site and wireless Internet access is complimentary. This motel offers access to a business center. A complimentary breakfast is offered each morning. This Boerne motel also offers an outdoor pool, laundry facilities, and an elevator (lift). Onsite self parking is complimentary.
Bengaluru to Nashville
SCL to Beijing
CMN GYD
HEL MCT
CGK TSE
HYD to Florida
ibis Avignon Centre Gare Vaucluse
Hotel Sardonyx Tokyo Parking

value: This website is an online travel agency owned by Expedia Group, an American online travel shopping company based in Seattle.


text:
Babylon: Shopkeeper Manual: 9781470750008 - Christianbook.com
Stock No: WW750006
Welcome to the Babylonian VBS Marketplace and discover the first century A.D. life! Kids and adults explore authentic ancient culture and make crafts in different shops. See how to make this experience so amazing kids will forget what century they really live in! (Help them imagine life before cell phones!) *One copy is included in the Ultimate Starter Kit and Ultimate Starter Kit Plus Digital.
ISBN: 1470750007
ISBN-13: 9781470750008
I'm the author/artist and I want to review Babylon: Shopkeeper Manual.

value:
This website is a Christian catalog and internet retailer.
Christian Book Distributors was started in 1978 by Stephen Hendrickson, 19 years old and a sophomore at Central Bible College in Springfield, Missouri, out of his parents’ home in Lynn, Massachusetts.


text: Jerry Stackhouse PicturesNEW YORK, NY - NOVEMBER 13: Dion Waiters #3 of the Cleveland Cavaliers drives against Jerry Stackhouse #42 of the Brooklyn Nets on November 13, 2012 at the Barclays Center in the Brooklyn Borough of New York City. NOTE TO USER: User expressly acknowledges and agrees that, by downloading and or using this photograph, user is consenting to the terms and conditions of the Getty Images License Agreement. Mandatory Copyright Notice: Copyright 2012 NBAE (Photo by Nathaniel S. Butler/NBAE via Getty Images)Jerry Stackhouse Photos »80 of 200

value: This website is the official website of ESPN. It is owned by ESPN Internet Ventures, a division of ESPN Inc.


text:
Revision as of 17:43, 20 July 2010 (view source)DunnPB (talk | contribs)← Older edit
[[England]] [[Image:Gotoarrow.png]] [[Lancashire]] [[Image:Gotoarrow.png]] [[Lancashire Parishes]] [[England]] [[Image:Gotoarrow.png]] [[Lancashire]] [[Image:Gotoarrow.png]] [[Lancashire Parishes]] +Guide to '''Preston St Wilfrid, Lancashire family history and genealogy:''' parish register transcripts, census records, birth records, marriage records, and death records. == Parish History == == Parish History ==
−St Wilfrid Preston was a chapel built by 1793 and lay within the civil parish boundaries of St John Preston. It was one of several such chapels built to ease the population growth and development in this township.+ +St Wilfrid Preston (see [[Preston_St_John,_Lancashire|Preston St John]]) was the '''original parish church''', from about the year 1094 A.D. However, the church came into disrepair and was demolished for another sometime in the 16th Century. In 1581, the name was changed to St John the Baptist, and then again it was changed to St John the Evangelist in 1770. There was also a Roman Catholic parish built by 1793 by this same name which lay within the civil parish boundaries of Preston. It was one of at least four or more Catholic churches built in Preston over a 75 year period.<ref>Lewis, Samuel A., ''[http://www.british-history.ac.uk/report.aspx?compid=51223#s7 A Topographical Dictionary of England]'' (1848), pp. 609-616.</ref> == Resources == == Resources ==

value: This website is a nonprofit organization and website offering genealogical records, education, and software. It is operated by The Church of Jesus Christ of Latter-day Saints , and is closely connected with the church's Family History Department.


text:
Patent US7433945 - Dynamic configuration and self-tuning of inter-nodal communication resources ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA database management system in which a plurality of nodes form a database instance, each node including a communication manager for dynamically configuring inter-nodal communication resources. The communication manager receives communication resource allocation requests from clients or a self-tuning...http://www.google.com/patents/US7433945?utm_source=gb-gplus-sharePatent US7433945 - Dynamic configuration and self-tuning of inter-nodal communication resources in a database management systemAdvanced Patent SearchPublication numberUS7433945 B2Publication typeGrantApplication numberUS 10/410,856Publication dateOct 7, 2008Filing dateApr 9, 2003Priority dateApr 24, 2002Fee statusPaidAlso published asCA2383825A1, US7650400, US8583756, US20040003088, US20080270590, US20090024653Publication number10410856, 410856, US 7433945 B2, US 7433945B2, US-B2-7433945, US7433945 B2, US7433945B2InventorsJack Hon Wai Ng, Jeffrey J. Goss, Hebert W. Pereyra, Kaarel Truuvert, Xun XueOriginal AssigneeInternational Business Machines CorporationExport CitationBiBTeX, EndNote, RefManPatent Citations (19), Non-Patent Citations (4), Referenced by (1), Classifications (7), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetDynamic configuration and self-tuning of inter-nodal communication resources in a database management systemUS 7433945 B2Abstract A database management system in which a plurality of nodes form a database instance, each node including a communication manager for dynamically configuring inter-nodal communication resources. The communication manager receives communication resource allocation requests from clients or a self-tuning algorithm. A resource self-tuning mechanism allocates or de-allocates memory blocks used for communication resource elements dynamically in real time without cycling the instance. Memory blocks are de-allocated asynchronously by placing associated communication resource elements in quarantine until all communication resource elements associated with the memory block are quarantined.
1. A method for configuring communication resources in database management systems, the method comprising:
receiving a communication resource configuration request at one of a plurality of server partitions that forms a database management system (DBMS) server instance. the communication resource configuration request being received from one of
a client in the system.
another server partition in the DBMS server instance, and
a daemon in the one server partition;
dynamically configuring a number of communication resource elements initialized in the one server partition for communication with one or more other server partitions in the DBMS server instance to satisfy the communication resource configuration request,
dynamic configuration of the number of communication resource elements initialized in the one server partition being accomplished in real-time without having to stop and restart the DBMS server instance; and
communicating the communication resource configuration request to at least one other server partition in the DBMS server instance using one or more communication resource elements initialized in the one server partition,
wherein the communication resource configuration request received by the one server partition is a request to increase communication resources and dynamically configuring the number of communication resource elements initialized in the one server partition comprises:
computing a number of communication resource elements that needs to be initialized to satisfy the request to increase communication resources;
computing a number of memory blocks that needs to be allocated to accommodate the number of communication resource elements needed, each memory block accommodating a predefined number of communication resource elements;
determining whether there are any communication resource elements in a quarantine area of the one server partition; and
responsive to there being no communication resource element in the quarantine area of the one server partition,
allocating the number of memory blocks needed from a shared memory set of the computer on which the one server partition is located, and
initializing the number of communication resource elements needed from the memory blocks allocated from the shared memory set of the computer on which the one server partition is located,
wherein responsive to there being one or more communication resource elements in the quarantine area of the one server partition, the one or more communication resource elements in the quarantine area being associated with one or more memory blocks marked for dynamic de-allocation, dynamically configuring the number of communication resource elements initialized in the one server partition further comprises:
determining whether a number of communication resource elements in the quarantine area is greater than or equal to the number of communication resource elements needed;
responsive to the number of communication resource elements in the quarantine area being greater than or equal to the number of communication resource elements needed,
releasing the number of communication resource elements needed from the quarantine area, and
returning the communication resource elements released from the quarantine area to a free resource pool of the one server partition, wherein responsive to the number of communication resource elements in the quarantine area being less than the number of communication resource elements needed, dynamically configuring the number of communication resource elements initialized in the one server partition further comprises:
releasing all communication resource elements in the quarantine area;
returning all communication resource elements released from the quarantine area to the free resource pool of the one server partition;
computing a number of additional communication resource elements that still needs to be initialized to satisfy the request to increase communication resources;
computing a number of additional memory blocks that still needs to be allocated to accommodate the number of additional communication resource elements still needed;
allocating the number of additional memory blocks still needed from the shared memory set of the computer on which the one server partition is located; and
initializing the number of additional communication resource elements still needed from the additional memory blocks allocated from the shared memory set of the computer on which the one server partition is located.
2. A method for configuring communication resources in database management systems, the method comprising:
receiving a communication resource configuration request at one of a plurality of server partitions that forms a database management system (DBMS) server instance, the communication resource configuration request being received from one of
a client in the system,
wherein the communication resource configuration request received by the one server partition is a request to decrease communication resources and dynamically configuring the number of communication resource elements initialized in the one server partition comprises:
computing a number of memory blocks that needs to be de-allocated to satisfy the request to decrease communication resources;
resolving all communication resource elements in a free resource pool of the one server partition to a quarantine area of the one server partition;
de-allocating each memory block in which all communication resource elements associated with the memory block are resolved in the quarantine area;
determining whether the number of memory blocks that needs to be de-allocated has been de-allocated; and
responsive to the number of memory blocks that needs to be de-allocated having been de-allocated, returning all communication resource elements that are not associated with a memory block marked for dynamic de-allocation from the quarantine area of the one server partition to the free resource pool of the one server partition,
wherein responsive to the number of memory blocks that needs to be de-allocated not having been de-allocated. dynamically configuring the number of communication resource elements initialized in the one server partition further comprises:
computing a number of additional memory blocks that still needs to be de allocated to satisfy the request to decrease communication resources;
determining whether any memory blocks have been marked for dynamic de allocation; and
responsive to no memory block having been marked for dynamic de-allocation,
marking one or more memory blocks for dynamic de-allocation,
a number of memory blocks marked for dynamic de-allocation being equal to the number of additional memory blocks still needed,
each memory block marked for dynamic de-allocation being selected based on a number of communication resource elements associated with the memory block that is resolved in the quarantine area of the one server partition, and
returning all communication resource elements that are not associated with a memory block marked for dynamic de-allocation from the quarantine area of the one server partition to the free resource pool of the one server partition,
wherein responsive to one or more memory blocks having been marked for dynamic de-allocation, dynamically configuring the number of communication resource elements initialized in the one server partition further comprises:
determining whether a number of memory blocks marked for dynamic de-allocation is greater than or equal to the number of additional memory blocks still needed;
responsive to the number of memory blocks marked for dynamic de-allocation being greater than or equal to the number of additional memory blocks still needed, returning all communication resource elements that are not associated with a memory block marked for dynamic de-allocation from the quarantine area of the one server partition to the free resource pool of the one server partition.
3. The method of claim 2, wherein responsive to the number of memory blocks marked for dynamic de-allocation being less than the number of additional memory blocks still needed, dynamically configuring the number of communication resource elements initialized in the one server partition further comprises:
computing a number of memory blocks that further needs to be de-allocated to satisfy the request to decrease communication resources;
a number of memory blocks marked for dynamic de-allocation being equal to the number of memory blocks further needed,
each memory block marked for dynamic de-allocation being selected based on a number of communication resource elements associated with the memory block that is resolved in the quarantine area of the one server partition; and
returning all communication resource elements that are not associated with a memory block marked for dynamic de-allocation from the quarantine area of the one server partition to the free resource pool of the one server partition. Description
CROSS-REFERENCE TO RELATED APPLICATIONS This application claims benefit under 35 U.S.C. 119 of Canadian Application 2,383,825 filed on Apr. 24, 2002.
FIELD OF THE INVENTION The invention relates to database management systems and in particular to dynamic configuration and self-tuning of inter-nodal communication resources within a database management system.
BACKGROUND OF THE INVENTION In database management systems such as International Business Machine's (IBM) DB2 Version 7, parameters that govern an amount of inter-nodal communication resources cannot be configured dynamically. A user must estimate values of communication resource parameters with respect to workloads that will be run against a system prior to starting up an instance of a database management system. However, if the estimate is not accurate or the workloads change after the instance has been started, then communication resources can be exhausted, thus preventing the database management system from servicing certain database requests without delay.
When such an event occurs, the user has to either reissue the request after other workloads have diminished or force all applications, stop the database instance, and reconfigure the communication resource parameters with more optimal values. This is clearly a penalty on the usability and performance of the database management system, because recycling the instance and rerunning the workloads are extremely time-consuming.
In addition, since communication resources can occupy a significant amount of memory space, the user may want to release resources in exchange for memory for other purposes. However, current database engine designs require that the instance be stopped and restarted in order for the new parameter values to take effect.
Prior art solutions that may solve the dynamic configuration problem do not service requests asynchronously or undo asynchronous requests without delay. In addition, they do not permit the database server to transparently increase or decrease its communication resources in response to fluctuations in communication workload requirements.
There is therefore a need for a database management system that permits users to dynamically configure communications resources used by the system. There also exists a need for a database management system that adapts to fluctuations in workloads in a way that is transparent to the user.
SUMMARY OF THE INVENTION It is therefore an object of the invention to provide a database management system that permits a client or an optimization algorithm to dynamically configure an amount of memory used for communications resources by the system.
It is a further object of the invention to provide a database management system that automatically adapts to fluctuations in workloads in a way that is transparent to the user.
The invention therefore provides a database management system in which a plurality of nodes form a database instance, each node including a communication manager for dynamically configuring inter-nodal communication resources. The communication manager receives communication resource allocation requests from clients or a self-tuning algorithm. A resource self-tuning mechanism allocates or de-allocates memory blocks used for communication resource elements dynamically in real time without cycling the instance. Memory blocks are de-allocated asynchronously by placing associated communication resource elements in quarantine until all communication resource elements associated with the memory block are quarantined.
BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 illustrates a schematic diagram of a computer network in which a plurality of partitions of a database management system (DB2) are deployed;
FIG. 2 illustrates a schematic diagram of DB2 server partitions in the deployment of the DB2 shown in FIG. 1;
FIG. 3 illustrates a schematic diagram of the resource self-tuning mechanism and free resource pool shown in FIG. 2;
FIGS. 4A and 4B are a flowchart of a method in accordance with the invention for increasing communications resource allocations;
FIGS. 5A and 5B are a flowchart of a first phase of a method in accordance with the invention for decreasing communications resource allocations; and
FIG. 6 is a flowchart of a second phase of the method for decreasing communications resource allocations.
DETAILED DESCRIPTION The invention therefore provides a database management system in which a plurality of nodes form a database instance. Each node comprises a fast communications manager (FCM) for dynamically reconfiguring inter-nodal communication resources. The FCM receives requests from clients or the optimization algorithm to re-allocate communication resources. A resource self-tuning mechanism maintains a memory descriptor table that stores a plurality of memory descriptors and a quarantine, for allocating and de-allocating communication resources in response to the requests received from the clients. A free-resource pool stores available communication resources.
The invention also provides a method for dynamically increasing communication resources available to the instance of the database. The method begins with a step of computing a number of additional memory blocks required to satisfy the request, then allocating new memory blocks to support the additional communication resources. A memory descriptor table is searched for a vacant entry. The new memory blocks are allocated and anchored by recording a pointer and a status of the memory block in the vacant entry. The communication resource elements are created from the new memory blocks and added to a free resource pool to make them available for inter-nodal communication services, until all the required additional resources have been created.
The invention also provides a two-phased method for decreasing the communication resources available to the instance of the database management system. In a first phase, the method involves searching for communication resource elements that can be de-allocated immediately, and registering those that must be de-allocated asynchronously. A second phase provides logic for moving a used resource element to a quarantine area, and de-allocating a memory block when all associated communication resource elements have been quarantined.
The second phase is invoked whenever a resource element is returned to the FCM. If the associated memory block is not marked for asynchronous de-allocation, the communication resource element is returned to the free memory pool. If the associated memory block is marked for asynchronous de-allocation, the associated communication resource element is placed in the quarantine.
An embodiment of the invention is described below with reference to International Business Machine's (IBM) DB2 Universal Database Manager (UDM) as an example of only one embodiment of a database management system. The invention is applicable to any database management system that uses inter-nodal communications resources.
FIG. 1 illustrates a schematic block diagram of a computer network 100 having a plurality of server computers 102,110 (only two shown) connected 116,118 to a network 120. The network 120 may be, for example, a local area network (LAN), a wide area network (WAN), a municipal area network (MAN), or an inter-network, such as the Internet. A client computer 124 controlled by a user (not shown) is also connected 122 to the network 120. Alternatively, the client 124 may be connected (not shown) directly to one of the server computers 102,110. Each server computer 102,110 has a respective memory 104,112. The memory 104 of the server computer 102 has a first DB2 server partition 108, and the memory 112 of the server computer 110 has an Nth DB2 server partition. The server partitions 108,114 are also individually called nodes. The server partitions 108,114 are collectively referred to as a database management system instance.
FIG. 2 illustrates a schematic diagram of a DB2 server instance 202 that includes the DB2 server partitions 108,114 shown in FIG. 1. The first DB2 server partition 108 includes a fast communications module 206 (FCM) and higher layers 220 of DB2 server. The FCM 206 has a resource self-tuning mechanism 208 for dynamically allocating or de-allocating communication resources 210 at a request of a user (not shown). The resource self-tuning mechanism 208 may also automatically allocate communication resources 214, if communication resource elements 214 in a free resource pool 212 begin to run out. The FCM 206 further includes an FCM daemon 218 that uses 217 the communication resource elements 214 to communicate 228 with other DB2 server partitions 114. The higher layers of the DB2 server 220 include a DB2 agent 222 that receives client resource allocation requests 224. The DB2 agent 222 communicates the client resource allocation requests using messages 216 to the resources self-tuning mechanism 208. The Nth DB2 server partition 114 is identical to the first DB2 server partition 108, even though only the FCM 230, FCM daemon 232 and higher layers of the Nth DB2 server 234 are shown for clarity. The DB2 server partitions 108,114 communicate 204 through the network 120 (FIG. 1).
FIG. 3 illustrates a schematic diagram of the resource self-tuning mechanism 208 and free resource pool 212 shown in FIG. 2. The resource self-tuning mechanism 208 includes a process 302 for returning communication resource elements after they are released from use by the FCM daemon 218 (FIG. 2), a memory descriptor table 304, a quarantine index table 316 and a quarantine area 330. It should be noted that the quarantine index table 316 is a data structure that is, for example, allocated and de-allocated during execution of methods in accordance with the invention, as described below. The memory descriptor table 304 includes a plurality of records, each having a memory descriptor 306, a status/state information field 308, and a memory pointer field 310. The status/state information field may be set to any one of three different values. The three values respectively represent a status of �USED�, �VACANT� or �ASYNCHRONOUS DE-ALLOCATION�. If the status/state information field 308 is set to �USED� then the respective memory pointer field 310 points to a raw memory block 314, and the memory block 314 has been allocated to communication resource elements which may be in the free resource pool 212, or in use by the FCM daemon 218. If the status/state information field 308 is set to �VACANT� the respective memory pointer field 310 is set to a null pointer 315 (this type of record is a null entry, because the memory descriptor table is preferably a static structure of a predetermined size). If the status/state information field 308 is set to �ASYNCHRONOUS DE-ALLOCATION�, the memory block is still held, pending release of associated communication resource elements, as will be described below in some detail. The quarantine area 330 is a collection of communication resource elements 332 that are associated with memory blocks pending de-allocation. The quarantine index table 316 includes a plurality of records each having an index field 318, a memory descriptor field 320, that stores a corresponding memory descriptor 306, and a field 322 that indicates a number of quarantined communication resource elements associated with the memory block identified by the memory descriptor field.
The invention also provides a method for dynamically increasing communication resources available to the instance 202 of the DB2. FIGS. 4A and 4B are a flowchart 400 of a method for handling a resource allocation request 224 (FIG. 2) received from a client or from the FCM daemon 218 to request a dynamic increase in communication resources. The client can request a dynamic increase (or decrease) in communication resources at any time. The FCM daemon 218 can request an increase if it finds that the free resource pool 212 is empty when it tries to initiate a communications session with another node 206, 230.
The method begins 402 with a step of computing a number of additional communication resource elements required, and the number of memory blocks that must be allocated to accommodate the communication resource elements (step 404). The number of communication resource elements required is computed, for example, by subtracting a current number of existing communication resource elements from a requested number. As is well known to persons skilled in the art, each memory block accommodates a predefined number of communication resource elements, the number being related to the operating system with which the DB2 is instantiated. Whenever a request for increasing communication resources is received, it is possible that the FCM 230 is already involved in a process of decreasing the communications resources, because the resource re-allocation requests can be sent at any time. Consequently, after the required number of additional resources has been computed, the quarantine is checked to determine if it is empty (step 405).
If the quarantine is empty, a process for decreasing communication resources, which will be explained below with reference to FIGS. 5A and 5B, is not underway. Consequently, the process proceeds to step 406, in which the required memory blocks are allocated from a shared memory set. If the shared memory set does not contain enough memory blocks to satisfy the request, the shared memory set is grown by sending a request to the operating system, in a manner well known in the art. It is assumed that the shared memory set can always be grown, and in practice this is almost inevitably true. If for any reason shared memory cannot be grown, the process cancels and a request denial message (not shown) is returned to the client. Next, the memory descriptor table 304 (step 408) is searched for a vacant entry. As noted above, the memory descriptor table 304 is a table of fixed size and contains at least as many rows as a maximum number of memory blocks permitted to be used for communication resources, as specified in a DB2 configuration file. In step 410 a one of the new memory blocks is allocated and anchored by creating a memory pointer that is stored in field 310 of the memory descriptor table 304. New communication resource elements 214 (FIG. 3) are constructed from the new memory block 314 and added to the free resource pool 212 to make them available for inter-nodal communication services (step 412). In step 414 it is determined whether the required number of new memory blocks 314 have been allocated. If so, the process branches back to step 408 where a next memory block is allocated, otherwise the process terminates (step 416).
If in step 405, described above, it is determined that the quarantine is not empty, a process to decrease communication resources is underway. Consequently, the process branches to step 418 (FIG. 4B), where it is determined whether the quarantine contains enough communication resource elements to satisfy the request to increase communication resources. If so, the required number of communication resource elements 332 are released from the quarantine (step 420). The released communication resource elements are then added back to the free resource pool 212 (step 422), and the status/state information field 308 in the memory descriptor table 304 for the corresponding memory blocks are changed from �ASYNCHRONOUS DE-ALLOCATION� to �USED� to indicate that the memory blocks are no longer to be de-allocated (step 424). In step 426 the quarantine is checked again to determine whether it is empty subsequent to the release performed in step 420. If the quarantine is empty, the process branches to connector �F� (FIG. 4A) at 432 and terminates. If the quarantine is not empty, there was a de-allocation request in progress that requested a larger decrease than the increase just performed. Consequently, the quarantine 330 is cleaned up by immediately de-allocating remaining communication resource elements 332 that the quarantine contains (step 428), and the corresponding entries in the memory descriptor table 304 are marked as �VACANT�. The process then branches to connector �F� (FIG. 4A) at 432, and terminates.
If in step 418 it is determined that the quarantine 330 does not contain sufficient communication resource elements 214 to satisfy the request, all of the quarantined communication resource elements are released (step 436). The memory descriptor table 304 is then modified to change the status/state information 308 related to the corresponding entries from �SYNCHRONOUS DE-ALLOCATION� to �USED� (step 438). The released communication resource elements are then returned to the free resource pool 212 (step 440). The number of additional communication resources required is then computed by subtracting the number released from the quarantine in step 436 from the total number computed in step 404, and the process branches back to connector �E� (FIG. 4A) at 444, where the process continues as explained above.
The method and system in accordance with the invention also permits a client to request that communications resources be de-allocated (decreased). Depending on the usage level of the communication resources at the time that the client request 224 is received, a sufficient number of free communication resource elements 214 might not be available for immediate de-allocation to satisfy the request. It can potentially take a long time before adequate free communication resource elements become available to satisfy the. de-allocation request 224. To avoid blocking the database management instance 202 from performing other tasks while the dynamic configuration request 224 is being serviced, the invention provides an asynchronous mechanism to handle dynamic de-allocation requests.
The invention provides a two-phased method for decreasing the communication resources available to the instance 202 of the database management system. A first phase of the method involves searching for memory blocks that can be de-allocated immediately, and registering those that must be de-allocated asynchronously. A second phase provides logic for moving a used communication resource element to a quarantine area, and performing garbage collection. The second phase is invoked whenever a communication resource element is returned to the FCM 206.
Since the process of locating and identifying memory blocks for immediate and asynchronous de-allocation can be computationally complex, the first phase of the method is optimized using the quarantine index (QI) table 316 (FIG. 3).
FIGS. 5A and 5B are a flowchart 500 for implementing the first phase of processing a request to decrease communication resources dynamically. The method starts 502 by computing a number of memory blocks to be de-allocated (step 504), using methods described above. Then memory space for a QI table 316 is allocated, if required, and the QI table 316 is initialized, if required (step 506). All the free communication resource elements 214 in the free resource pool 212 are resolved into quarantine area 330, and the QI table 316 is correspondingly updated (step 508). The QI table 316 is then sorted according to the number of quarantined communication resource elements for each memory descriptor (step 510). If it is determined (step 512) that the required number of memory blocks have not been de-allocated, the process advances to step 522 (FIG. 5B), which is described below. Otherwise, the QI table 316 is de-allocated, if required (step 514). The free resource pool 212 is then reconstructed from the elements 332 in the quarantine area 330 that are not marked for asynchronous de-allocation (step 516) and the process finishes (step 520).
If the QI table 316 indicates that more memory blocks cannot be de-allocated immediately (step 522) the process moves to step 528, described below. Otherwise, using the sorted QI table 316, a memory block for immediate de-allocation is located (step 524). The memory block can be immediately de-allocated if the number of quarantined communication resource elements 332, which is recorded in column 322 of the quarantine index table 316 is equal to the total number of communication resource elements that can be created using the raw memory block. The memory block is de-allocated and the corresponding status/state information entry 308 in the memory descriptor table 304 is changed to �VACANT� (step 526). Thereafter, the process returns to step 512.
If the process branched from step 522 to step 528, as explained above, it is determined in step 528 whether all of the required memory blocks 314 are marked for asynchronous de-allocation. If so, the process returns to step 514 (FIG. 5A). Otherwise, using the sorted QI table 316, a memory block with the highest number of quarantined communication resource elements 332 is located and marked for asynchronous de-allocation in the memory descriptor table 304. Steps 528,530 are repeated until all memory blocks in the QI table 316 are marked for asynchronous de-allocation.
FIG. 6 shows a flowchart 600 of the second phase of the method for responding to a request to decrease communication resources dynamically. The method starts 602 with a step of indexing into the memory descriptor table 304 using the memory descriptor of a returning communication resource elements 302 (step 603). It is then determined (step 604) whether the memory block associated with the returning communication resource element 302 in the memory descriptor table 304 has its status/state information 308 set to �ASYNCHRONOUS DE-ALLOCATION�. If it does not, it is recycled to the free resource pool 212 (step 606) and the process finishes (step 614). Otherwise, the communication resource element 302 is placed in the quarantine area 330 (step 608). If it is determined in step 610 that the quarantine area 330 is full, or a predetermined quarantine threshold has been exceeded, garbage collection is performed to de-allocate any memory blocks that can be immediately de-allocated (step 612) because all associated communication resource elements have been returned to the quarantine. In either case, the process ends at 614.
Self-tuning of communication resources in adaptation to user workloads employs the method described above with reference to FIGS. 4, 5 and 6. The methods are invoked when the FCM component detects that resources have fallen below or risen above self-diagnosed thresholds, which are statically or dynamically established using specified or computed configuration parameters.
An advantage of the invention is that it permits clients to adjust inter-nodal communication resources, in an asynchronous fashion, without having to stop all applications and recycle the instance 202. In addition, because of the memory descriptor table 304 and the quarantine area 330, users can submit new requests 224 to adjust the resources immediately even when there is a request pending completion (which could take a long time). The FCM 206 does not have to wait for a background request to be finished before servicing a new request. Advantageously, this permits users to undo submitted requests immediately. As well, the invention provides a database management system's inter-nodal communication component with an ability to self-tune its communication resources in adaptation to workload requirements, without affecting running applications or requiring manual intervention by a database administrator.
The embodiment(s) of the invention described above is intended to be exemplary only. The scope of the invention is therefore intended to be limited solely by the scope of the appended claims.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5371733Mar 4, 1993Dec 6, 1994International Business Machines CorporationMethod and apparatus for centralized determination of virtual transmission delays in networks of counter-synchronized communication devicesUS5854896 *Jun 17, 1996Dec 29, 1998International Business Machines CorporationSystem for preserving logical partitions of distributed parallel processing system after re-booting by mapping nodes to their respective sub-environmentsUS6072774May 5, 1997Jun 6, 2000MotorolaCommunication network and method for managing internodal link topologyUS6192391May 11, 1998Feb 20, 2001Nec CorporationProcess stop method and apparatus for a distributed memory multi-processor systemUS6247109 *Jun 10, 1998Jun 12, 2001Compaq Computer Corp.Dynamically assigning CPUs to different partitions each having an operation system instance in a shared memory spaceUS6247161Sep 1, 1998Jun 12, 2001Advanced Micro Devices, Inc.Dynamically configured on-chip communications paths based on statistical analysisUS6275975Nov 10, 1998Aug 14, 2001Advanced Micro Devices, Inc.Scalable mesh architecture with reconfigurable paths for an on-chip data transfer network incorporating a network configuration managerUS6278718Aug 29, 1996Aug 21, 2001Excel, Inc.Distributed network synchronization systemUS6381682 *Jun 10, 1998Apr 30, 2002Compaq Information Technologies Group, L.P.Method and apparatus for dynamically sharing memory in a multiprocessor systemUS6442661 *Feb 29, 2000Aug 27, 2002Quantum CorporationSelf-tuning memory management for computer systemsUS6442706 *Oct 30, 2000Aug 27, 2002Legato Systems, Inc.Resource allocation throttle for remote data mirroring systemUS6748429 *Jan 10, 2000Jun 8, 2004Sun Microsystems, Inc.Method to dynamically change cluster or distributed system configurationUS6785888 *Feb 24, 1998Aug 31, 2004International Business Machines CorporationMemory allocator for a multiprocessor computer systemUS7058702 *Jan 4, 2002Jun 6, 2006Hewlett-Packard Development Company, L.P.Efficient validation of network configuration change commandsUS7152157 *Mar 5, 2003Dec 19, 2006Sun Microsystems, Inc.System and method for dynamic resource configuration using a dependency graphUS20010033646Jun 20, 2001Oct 25, 2001Kelvin PorterMethod of and system for providing services in a communications networkUS20030135619 *Jul 15, 2002Jul 17, 2003Wilding Mark F.Dynamic status tree facilityUS20040177245 *Mar 5, 2003Sep 9, 2004Murphy Richard C.Automated resource management using perceptron predictionEP0989490A2Sep 7, 1999Mar 29, 2000Ncr International Inc.Protocol for dynamic binding of shared resources* Cited by examinerNon-Patent CitationsReference1A WOS/Sup TM/-Based Solution for High Performance Computing; N. Abdennadher, G. Babin, P. Kropf; This paper appears in Cluster Computing and the Grid, 2001. Proceedings. First IEEE/ACM International Symposium, pp. 568-573.2Fault-Tolerant Hierarchical Routing; G. Alari, A Datta, J Derby and J. Lawrence; This papers appears in Performance, Computing and Communications Conference, 1997. IPCCC 1997, IEEE International, pp. 159-165.3Intelligent Agents for Network Management, C. Frei and B. Faltings; This paper appears in AI for Network Management Systems (Digest No. 1997/094), IEEE Colloquium, pp. 2/1-2/4.4The Design of High Availability in the Dawning Server Consolidation System; M. Chen, W. Gao, W. Zhang, L. Wu; High This paper appears in Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition, pp. 436-438, vol. 1.Referenced byCiting PatentFiling datePublication dateApplicantTitleUS7574620 *Aug 2, 2006Aug 11, 2009Fujitsu Siemens Computers GmbhMethod for operating an arrangement of a plurality of computers in the event of a computer failure* Cited by examinerClassifications U.S. Classification709/223, 711/147, 709/213International ClassificationG06F9/50, G06F15/173Cooperative ClassificationG06F9/5016European ClassificationG06F9/50A2MLegal EventsDateCodeEventDescriptionJun 29, 2012FPAYFee paymentYear of fee payment: 4Jun 29, 2012SULPSurcharge for late paymentMay 21, 2012REMIMaintenance fee reminder mailedApr 9, 2003ASAssignmentOwner name: IBM CORPORATION, NEW YORKFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:NG, JACK HON WAI;GOSS, JEFFREY J.;PEREYRA, HEBERT W.;ANDOTHERS;REEL/FRAME:013969/0470;SIGNING DATES FROM 20020415 TO 20020422RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
Mobile-geddon! From cash to cameras, smartphones are killing off our everyday essentials | Daily Mail Online
Published: 05:36 EDT, 11 August 2015 | Updated: 11:18 EDT, 11 August 2015
From cameras to address books, our pockets and handbags already feel lighter compared to ten years ago thanks to the rise of smartphones.
Futurist Dr Ian Pearson believes handsets are the new Swiss Army knife because they offer users multiple tools in a compact space.
And by 2025 he claims many of our everyday essentials will be rendered completely redundant as devices become more powerful and ubiquitous.
Items we consider everyday essentials will be rendered redundant as smartphones (stock image) become increasingly more powerful, according to futurist Dr Ian Pearson
Over the next decade it is estimated more than eight billion people will use at least one smartphone, making it the go-to gadget for our daily lives.
Why you should NEVER put your phone number on Facebook:... Generation #fail: Social media addicts are more likely to...
Dr Pearson believes fumbling for keys will be a thing of the past by 2025 as smartlocks will enable people to lock and unlock their homes using their smartphone. The August lock, which offers this function, is pictured
ENDANGERED EVERYDAY ESSENTIAL ITEMS
Smart locks could spell the end of bunches of keys.
Sales of compact digital cameras have fallen by 40 per cent as smartphone cameras improve in quality.
Dr Pearson predicts that by 2050 they will not only capture our memories but sensations too.
This is already true for users of the August smart lock who can unlock and lock their front door using a mobile app, or even by tapping their Apple Watch.
Dr Pearson believes TV remotes and music controllers have also had their day.
'Rather than having a different remote for every TV and music system, within ten years smartphones will be the universal remote, giving us more power at our fingertips than ever before.
'They'll control our entertainment in the home, providing a personal experience via any device in range.'
Dr Pearson continued: 'In our homes, smartphones will be used to control many essential systems, from our heating to our lighting.
'In the kitchen, we'll be able to link recipe instructions on our phones to our appliances and our phones will become crucial for making sure our cupboards are full with essentials just before we run out.'
He also predicts torches and alarm clocks will become a thing of the past.
Already, 57 per cent of us rely on our mobile for our morning wake-up call and by 2020, 90 per cent of alarm clocks will be banished to a bedroom drawer while users swap to apps that tune into dream and sleep cycles as well as telling the time, for example.
While cameras and mirrors may be replaced by the smartphone, people's vanity will not diminish in the next decade, Dr Pearson suggested.
'By 2020 compact digital cameras will be all but replaced by high-quality smartphone lenses,' he said.
'By 2020 compact digital cameras will be all but replaced by high quality smartphone lenses,' Dr Pearson said. This stock image shows a couple using their smartphone to take a selfie
Already, 57 per cent of us rely on our mobile for our morning wake-up call and by 2020, 90 per cent of alarm clocks (stock image) will be banished to a bedroom drawer, he predicts
'Sales have already fallen by 40 per cent and with picture quality vastly improved on our mobiles, the writing's on the wall.
'By 2050, not only will our mobiles be able to record footage, but by linking with membrane pads on our body, they will be able to capture our sensations and simulate them when playing back through these same pads, letting us experience the virtual rush of a bungee jump or the joy of welcoming our first child into the world.'
Dr Person believes that it's not just our cameras that will be left at home gathering dust, though.
'Pocket mirrors will disappear in favour of the portable dressing room in our pockets.
'By 2025 augmented reality will allow us to '"wear" any number of stylish outfits or virtually try the newest haircut.
'Contactless payment is already changing the way we shop, but by 2025, 75 per cent of all of our cash and cards will have been replaced by the quicker and easier tap-and-pay alternative,' the futurist said. A stock image of a purse full of notes is shown
Contactless Apple Pay (pictured), for example, launched in the US last year and in the UK in July
'Anti-ageing creams that don't live up to their promise will also be put to the test as our phones will be able to microscopically zoom into our skin and work out whether they're really making a difference,' he said.
Our wallets will be empty too.
'Driving licences will have moved onto our smartphones by 2017 and will talk directly to new 'friendly' speed cameras, Dr Pearson said.
'Contactless payment is already changing the way we shop, but by 2025, 75 per cent of all of our cash and cards will have been replaced by the quicker and easier tap-and-pay alternative.'
Apple Pay, for example, launched in the US last year and in the UK in July.
'Fingerprint and retina recognition will allow all payments to be made through your mobile. This goes for foreign currency too, with smartphones cutting out that trip to the currency exchange and converting currency at the best rates every time you pay.'
And when it comes to going abroard, holidaymakers won't need separate guidebooks, language guides and tickets.
'Two years from now most travellers will have thrown out their bulky guide books for good in favour of regularly updated travel apps,' Dr Pearson said.
'By 2020, such tools will make sight-seeing even better, with virtual and augmented reality experiences letting travellers see Henry VIII beheading his wives at the Tower of London or virtually relive Mo Farah's final 100m in the Olympic Stadium.'
'Paper travel tickets and boarding passes will be checking out too.
'Already apps such as Apple's Passbook are absorbing them into smartphones, but travel will eventually be completely paperless,' meaning there will be shorter queues at customs and departure gates.
'Two years from now most travellers will have thrown out bulky guide books for good in favour of regularly updated travel apps,' Dr Pearson said. Here, a holiday maker uses their smartphone to navigate an Italian city

value: This website is the website of the Daily Mail, a newspaper in the United Kingdom, and of its sister paper The Mail on Sunday. MailOnline is a division of dmg media, which is owned by Daily Mail and General Trust plc.


text:
Patent US5682513 - Cache queue entry linking for DASD record updates - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA data storage system provides disaster recovery capability by asynchronously transmitting record updates to a secondary site in sequence consistent order. Such record updates are stored at a primary site in a cache memory of a storage controller. A circular queue is created having a head pointer for...http://www.google.com/patents/US5682513?utm_source=gb-gplus-sharePatent US5682513 - Cache queue entry linking for DASD record updatesAdvanced Patent SearchPublication numberUS5682513 APublication typeGrantApplication numberUS 08/414,826Publication dateOct 28, 1997Filing dateMar 31, 1995Priority dateMar 31, 1995Fee statusPaidPublication number08414826, 414826, US 5682513 A, US 5682513A, US-A-5682513, US5682513 A, US5682513AInventorsSusan Kay Candelaria, Vernon John Legvold, Warren Keith StanleyOriginal AssigneeInternational Business Machines CorporationExport CitationBiBTeX, EndNote, RefManPatent Citations (5), Non-Patent Citations (4), Referenced by (140), Classifications (7), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetCache queue entry linking for DASD record updatesUS 5682513 AAbstract A data storage system provides disaster recovery capability by asynchronously transmitting record updates to a secondary site in sequence consistent order. Such record updates are stored at a primary site in a cache memory of a storage controller. A circular queue is created having a head pointer for locating a first (or oldest) record update with subsequent record updates of a track being linked therefrom in sequence consistent order. A tail pointer of the circular queue points to the last record update. A counter field is provided in a track slot header for counting a number of updated records in the track and hence the circular queue. When a data mover in the host processor at the primary site reads record updates for transmission to the secondary site, the data mover starts with the record update pointed to by the head pointer such that the data mover moves through the circular queue (and hence the record updates) in a backward chain fashion. The counter is decremented as each record update in the track is read by the data mover such that when the counter reaches zero the data mover knows that no other record updates exist for that track.
What is claimed is: 1. A storage controller in a data storage system for linking, in a backward chain using a circular queue, a plurality of record updates in a first track, said data storage system including a host processor coupled to said storage controller and running an application generating the plurality of record updates, and a direct access storage device (DASD) coupled to said storage controller for storing said plurality of record updates, said storage controller comprising:a storage path for directing record updates between said DASD and said host processor; and a cache memory coupled to said storage path for storing a first track slot, said first track slot storing a first track including the plurality of record updates, said cache memory further storing a first track slot header corresponding to said first track slot and having a Q counter for counting a number of records updated in said first track slot and having a Q anchor pointer for referencing an entry in the circular queue, wherein the circular queue contains one entry for each record update of said plurality of record updates, each entry including a Q Type field, a data pointer, and a Q Chain pointer, each entry further linked to form the backward chain and to maintain an order consistent with a sequence in which the record updates are made. 2. The storage controller according to claim 1 wherein each circular queue entry further includes a Time Stamp.
5. A data storage system comprising:a host processor running an application therein generating a plurality of record updates; a channel coupled to said host processor; a direct access storage device (DASD) for storing said plurality of record updates; a storage controller coupled between said channel and said DASD, said storage controller comprising:a port coupled to said channel; a storage path coupled between said port and said DASD, said storage path directing movement of said plurality of record updates between said host processor and said DASD; and a cache memory coupled to said storage path for storing a first track slot, said first track slot storing a first track including the plurality of record updates, said cache memory further storing a first track slot header corresponding to said first track slot and having a Q counter for counting a number of records updated in said first track slot and having a Q anchor pointer for referencing an entry in a circular queue, wherein the circular queue contains one entry for each record update of said plurality of record updates, each entry including a Q Type field, a data pointer, and a Q Chain pointer, each entry further linked to form the backward chain and to maintain an order consistent with a sequence in which the record updates are made. 6. The data storage system according to claim 5 wherein each circular queue entry further includes a Time Stamp.
9. The data storage system according to claim 8 further comprising:a remote host processor for receiving said plurality of record updates from said data mover; a remote storage controller coupled to said remote host processor; and a remote DASD coupled to said remote storage controller for storing said plurality of record updates thereon for back-up purposes. 10. The data storage system according to claim 6 wherein said cache memory further includes a second track slot header and a second track slot for storing updates to one or more record updates of said plurality of record updates.
FIELD OF THE INVENTION The present invention relates generally to data storage techniques, and more particularly, to a system for improving backup copy performance of direct access storage device (DASD) data.
SUMMARY OF THE INVENTION An object of the present invention is to provide an improved design and method for shadowing DASD data to a secondary site for disaster recovery.
DETAILED DESCRIPTION A typical data processing system may take the form of a host processor, such as an IBM System/360 or IBM System/370 processor for computing and manipulating data, and running, for example, data facility storage management subsystem/multiple virtual systems (DFSMS/MVS) software, having at least one IBM 3990 storage controller attached thereto. Typically the storage controller includes a memory controller and one or more cache memory types incorporated therein. The storage controller is further connected to a group of direct access storage devices (DASDs) such as IBM 3380 or 3390 DASDs. While the host processor provides substantial computing power, the storage controller provides the necessary functions to efficiently transfer, stage/destage, convert and generally access large databases.
SYNCHRONOUS DATA SHADOWING Synchronous real time remote copy for disaster recovery requires that copied DASD volumes form a set. Forming such a set further requires that a sufficient amount of system information be provided to the secondary site for identifying those volumes (VOLSERs) comprising each set and the primary site equivalents. Importantly, the secondary site forms a "duplex pair" with the primary site and the secondary site must recognize when one or more volumes are out of sync with the set, that is, "failed duplex" has occurred. Connect failures are more visible in synchronous remote copy than in asynchronous remote copy because the primary DASD I/O is delayed while alternate paths are retried. The primary site can abort or suspend copy to allow the primary site to continue while updates for the secondary site are queued, the primary site marking such updates to show the secondary site is out of sync. Recognizing exception conditions that may cause the secondary site to fall out of sync with the primary site is needed in order that the secondary site be available at any time for disaster recovery. Error conditions and recovery actions must not make the secondary site inconsistent with the primary site.
ASYNCHRONOUS DATA SHADOWING Asynchronous remote data shadowing is used when it is necessary to further increase a distance between primary and secondary sites for reducing the probability that a single disaster will corrupt both primary and secondary sites, or when primary application performance impact needs to be minimized. While the distance between primary and secondary sites can now stretch across the earth or beyond, the synchronization of write updates across multiple DASD volumes behind multiple primary subsystems to multiple secondary subsystems is substantially more complicated. Record write updates can be shipped from a primary storage controller via a primary data mover to a secondary data mover for shadowing on a secondary storage subsystem, but the amount of control data passed therebetween must be minimized while still being able to re-construct an exact order of the record write updates on the secondary system across several storage controllers as occurred on the primary system across multiple DASD volumes behind several storage controllers.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4392200 *Feb 27, 1981Jul 5, 1983Digital Equipment CorporationCached multiprocessor system with pipeline timingUS5263154 *Apr 20, 1992Nov 16, 1993International Business Machines CorporationMethod and system for incremental time zero backup copying of dataUS5303362 *Mar 20, 1991Apr 12, 1994Digital Equipment CorporationCoupled memory multiprocessor computer system including cache coherency management protocolsUS5418929 *Jan 28, 1994May 23, 1995Hitachi, Ltd.Controller for storage unit and method of controlling storage unitUS5504861 *Feb 22, 1994Apr 2, 1996International Business Machines CorporationRemote data duplexing* Cited by examinerNon-Patent CitationsReference1IBM TDB, V. 37, N. 02A, Feb., 1994, p. 481, "Method for Improving the Host I/O Performance During Concurrent Copy".2 *IBM TDB, V. 37, N. 02A, Feb., 1994, p. 481, Method for Improving the Host I/O Performance During Concurrent Copy .3Schneider, G. Michael, and Steven C. Bruell. "Concepts in Data Structures and Software Development". New York: West Publishing Company, 1991.4 *Schneider, G. Michael, and Steven C. Bruell. Concepts in Data Structures and Software Development . New York: West Publishing Company, 1991.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS5781912 *Dec 19, 1996Jul 14, 1998Oracle CorporationRecoverable data replication between source site and destination site without distributed transactionsUS5889935 *Mar 17, 1997Mar 30, 1999Emc CorporationDisaster control features for remote data mirroringUS5901327 *Mar 17, 1997May 4, 1999Emc CorporationBundling of write data from channel commands in a command chain for transmission over a data link between data storage systems for remote data mirroringUS5963960 *Oct 29, 1996Oct 5, 1999Oracle CorporationMethod and apparatus for queuing updates in a computer systemUS6065018 *Mar 4, 1998May 16, 2000International Business Machines CorporationSynchronizing recovery log having time stamp to a remote site for disaster recovery of a primary database having related hierarchial and relational databasesUS6148382 *Dec 23, 1996Nov 14, 2000Emc CorporationArrangement for filtering data item updates to reduce the number of updates to a data item to be stored on mass data storage facilityUS6173377Apr 17, 1998Jan 9, 2001Emc CorporationRemote data mirroringUS6260124Aug 13, 1998Jul 10, 2001International Business Machines CorporationSystem and method for dynamically resynchronizing backup dataUS6301643Sep 3, 1998Oct 9, 2001International Business Machines CorporationMulti-environment data consistencyUS6304980Jan 19, 1999Oct 16, 2001International Business Machines CorporationPeer-to-peer backup system with failure-triggered device switching honoring reservation of primary deviceUS6347344Oct 14, 1998Feb 12, 2002Hitachi, Ltd.Integrated multimedia system with local processor, data transfer switch, processing modules, fixed functional unit, data streamer, interface unit and multiplexer, all integrated on multimedia processorUS6360232Jun 2, 1999Mar 19, 2002International Business Machines CorporationDisaster recovery method for a removable media libraryUS6434649Oct 14, 1998Aug 13, 2002Hitachi, Ltd.Data streamerUS6438651 *Nov 1, 1999Aug 20, 2002International Business Machines CorporationMethod, system, and program for managing requests to a cache using flags to queue and dequeue data in a bufferUS6526419Jun 9, 2000Feb 25, 2003International Business Machines CorporationMethod, system, and program for remote copy in an open systems environmentUS6560674Oct 14, 1998May 6, 2003Hitachi, Ltd.Data cache systemUS6608625Oct 14, 1998Aug 19, 2003Hitachi, Ltd.Three dimensional graphic processorUS6678787 *Dec 21, 2000Jan 13, 2004International Business Machines CorporationDASD-free non-volatile updatesUS6704837Jun 29, 1998Mar 9, 2004International Business Machines CorporationMethod and apparatus for increasing RAID write performance by maintaining a full track write counterUS6718352 *Mar 20, 2001Apr 6, 2004Emc CorporationMethods and apparatus for managing a data set stored on a data storage deviceUS6732193Jun 9, 2000May 4, 2004International Business Machines CorporationMethod, system, and program for determining a number of write operations to executeUS6745212 *Jun 27, 2001Jun 1, 2004International Business Machines CorporationPreferential caching of uncopied logical volumes in an IBM peer-to-peer virtual tape serverUS6772303Feb 15, 2001Aug 3, 2004International Business Machines CorporationSystem and method for dynamically resynchronizing backup dataUS6901481Feb 22, 2001May 31, 2005Stratus Technologies Bermuda Ltd.Method and apparatus for storing transactional information in persistent memoryUS6910098 *Feb 11, 2003Jun 21, 2005Emc CorporationMethod and apparatus for maintaining data coherencyUS7031085Apr 18, 2002Apr 18, 2006Seagate Technology LlcVersion tracking of disk write operationsUS7085886May 28, 2003Aug 1, 2006International Buisness Machines CorporationAutonomic power loss recovery for a multi-cluster storage sub-systemUS7111004Jun 18, 2003Sep 19, 2006International Business Machines CorporationMethod, system, and program for mirroring data between sitesUS7111139Mar 2, 2004Sep 19, 2006Hitachi, Ltd.Data synchronization of multiple remote storageUS7134044Aug 16, 2002Nov 7, 2006International Business Machines CorporationMethod, system, and program for providing a mirror copy of dataUS7143122Oct 28, 2003Nov 28, 2006Pillar Data Systems, Inc.Data replication in data storage systemsUS7152079 *Aug 27, 2003Dec 19, 2006Hitachi, Ltd.Data replication among storage systemsUS7159088Sep 30, 2004Jan 2, 2007Hitachi, Ltd.Storage system and data processing systemUS7197615Sep 2, 2004Mar 27, 2007Hitachi, Ltd.Remote copy system maintaining consistencyUS7209972 *Feb 1, 2000Apr 24, 2007Commvault Systems, Inc.High speed data transfer mechanismUS7216209Jan 28, 2004May 8, 2007Hitachi, Ltd.Data processing system having a plurality of storage systemsUS7219201Dec 30, 2003May 15, 2007Hitachi, Ltd.Remote storage disk control device and method for controlling the sameUS7272670Feb 5, 2001Sep 18, 2007HitachiIntegrated multimedia systemUS7296126Jun 23, 2006Nov 13, 2007Hitachi, Ltd.Storage system and data processing systemUS7302536 *Jun 17, 2003Nov 27, 2007Hitachi, Ltd.Method and apparatus for managing replication volumesUS7313663Mar 2, 2007Dec 25, 2007Hitachi, Ltd.Storage system and data processing systemUS7328373Oct 10, 2006Feb 5, 2008Hitachi, Ltd.Data processing systemUS7376805Apr 21, 2006May 20, 2008Hewlett-Packard Development Company, L.P.Distributed storage arrayUS7401154May 13, 2002Jul 15, 2008Commvault Systems, Inc.Pipelined high speed data transfer mechanismUS7404005Jun 9, 2000Jul 22, 2008International Business Machines CorporationMethod, system, and program for selecting one of multiple paths to communicate with a deviceUS7421538 *Nov 19, 2003Sep 2, 2008Fujitsu LimitedStorage control apparatus and control method thereofUS7437515 *Jan 18, 2005Oct 14, 2008Emc CorporationData structure for write pendingUS7440982Nov 15, 2004Oct 21, 2008Commvault Systems, Inc.System and method for stored data archive verificationUS7457890Oct 30, 2006Nov 25, 2008Hitachi, Ltd.Integrated multimedia systemUS7478211Jan 9, 2004Jan 13, 2009International Business Machines CorporationMaintaining consistency for remote copy using virtualizationUS7487311Mar 14, 2008Feb 3, 2009Hewlett-Packard Development Company, L.P.System and method for asynchronous backup of virtual disks in a distributed storage arrayUS7529901Oct 9, 2007May 5, 2009Hitachi, Ltd.Storage system and data processing systemUS7543125Dec 19, 2005Jun 2, 2009Commvault Systems, Inc.System and method for performing time-flexible calendric storage operationsUS7548996Sep 12, 2005Jun 16, 2009Hitachi, Ltd.Data streamerUS7581077Jan 3, 2005Aug 25, 2009Commvault Systems, Inc.Method and system for transferring data in a storage operationUS7606844Dec 19, 2005Oct 20, 2009Commvault Systems, Inc.System and method for performing replication copy storage operationsUS7613748Dec 19, 2005Nov 3, 2009Commvault Systems, Inc.Stored data reverification management system and methodUS7617175 *Apr 21, 1999Nov 10, 2009Cisco Technology, Inc.Method and apparatus for upgrading a database in a redundant environment by release chainingUS7617253Dec 18, 2006Nov 10, 2009Commvault Systems, Inc.Destination systems and methods for performing data replicationUS7617262Dec 18, 2006Nov 10, 2009Commvault Systems, Inc.Systems and methods for monitoring application data in a data replication systemUS7620710Dec 19, 2005Nov 17, 2009Commvault Systems, Inc.System and method for performing multi-path storage operationsUS7636743Dec 18, 2006Dec 22, 2009Commvault Systems, Inc.Pathname translation in a data replication systemUS7651593Dec 18, 2006Jan 26, 2010Commvault Systems, Inc.Systems and methods for performing data replicationUS7660958Nov 6, 2008Feb 9, 2010International Business Machines CorporationMaintaining consistency for remote copy using virtualizationUS7661028 *Dec 18, 2006Feb 9, 2010Commvault Systems, Inc.Rolling cache configuration for a data replication systemUS7685176Sep 15, 2006Mar 23, 2010Pillar Data Systems, Inc.Systems and methods of asynchronous data replicationUS7739381Aug 22, 2007Jun 15, 2010Commvault Systems, Inc.System and method for providing encryption in storage operations in a storage network, such as for use by application service providers that provide data storage servicesUS7802137Dec 14, 2007Sep 21, 2010Hitachi, Ltd.Journaling system switching to another logical volume to store subsequently received update historyUS7861050Dec 11, 2007Dec 28, 2010Comm Vault Systems, Inc.Systems and methods for combining data streams in a storage operationUS7865678Jan 23, 2007Jan 4, 2011Hitachi, Ltd.Remote copy system maintaining consistencyUS7870355Dec 18, 2006Jan 11, 2011Commvault Systems, Inc.Log based data replication system with disk swapping below a predetermined rateUS7890718May 18, 2009Feb 15, 2011Comm Vault Systems, Inc.System and method for performing time-flexible calendric storage operationsUS7890719Jul 2, 2009Feb 15, 2011Commvault Systems, Inc.System and method for performing time-flexible calendric storage operationsUS7925629 *Mar 28, 2007Apr 12, 2011Netapp, Inc.Write ordering style asynchronous replication utilizing a loosely-accurate global clockUS7962455Dec 15, 2009Jun 14, 2011Commvault Systems, Inc.Pathname translation in a data replication systemUS7962642Jun 26, 2008Jun 14, 2011Commvault Systems, Inc.Pipeline systems and method for transferring data in a network environmentUS7962709Dec 18, 2006Jun 14, 2011Commvault Systems, Inc.Network redirector systems and methods for performing data replicationUS7975061Nov 7, 2005Jul 5, 2011Commvault Systems, Inc.System and method for performing multistream storage operationsUS7984200 *Oct 17, 2008Jul 19, 2011Western Digital Technologies, Inc.Configuring a data storage device with a configuration data record set in response to a configuration codeUS8015427Apr 23, 2007Sep 6, 2011Netapp, Inc.System and method for prioritization of clock rates in a multi-core processorUS8019963Aug 24, 2009Sep 13, 2011Commvault Systems, Inc.Systems and methods for transferring data in a block-level storage operationUS8024294Oct 19, 2009Sep 20, 2011Commvault Systems, Inc.Systems and methods for performing replication copy storage operationsUS8037171May 9, 2008Oct 11, 2011International Business Machines CorporationSystem and program for selecting one of multiple paths to communicate with a deviceUS8041673Jan 21, 2011Oct 18, 2011Commvault Systems, Inc.Hierarchical systems and methods for performing data storage operationsUS8078583May 18, 2009Dec 13, 2011Comm Vault Systems, Inc.Systems and methods for performing storage operations using network attached storageUS8086809Sep 20, 2010Dec 27, 2011Commvault Systems, Inc.Interface systems and methods for accessing stored dataUS8099571Aug 6, 2008Jan 17, 2012Netapp, Inc.Logical block replication with deduplicationUS8103670Oct 30, 2008Jan 24, 2012Commvault Systems, Inc.Systems and methods for retrieving data in a computer networkUS8103829Jun 22, 2010Jan 24, 2012Commvault Systems, Inc.Hierarchical systems and methods for performing storage operations in a computer networkUS8112543Jun 24, 2011Feb 7, 2012Commvault Systems, Inc.System and method for performing multistream storage operationsUS8121983Oct 27, 2009Feb 21, 2012Commvault Systems, Inc.Systems and methods for monitoring application data in a data replication systemUS8131964Dec 15, 2010Mar 6, 2012Commvault Systems, Inc.Systems and methods for combining data streams in a storage operationUS8150800Mar 28, 2007Apr 3, 2012Netapp, Inc.Advanced clock synchronization techniqueUS8156086Oct 9, 2008Apr 10, 2012Commvault Systems, Inc.Systems and methods for stored data verificationUS8190565Nov 22, 2010May 29, 2012Commvault Systems, Inc.System and method for performing an image level snapshot and for restoring partial volume dataUS8195623Mar 20, 2009Jun 5, 2012Commvault Systems, Inc.System and method for performing a snapshot and for restoring dataUS8204859Apr 15, 2009Jun 19, 2012Commvault Systems, Inc.Systems and methods for managing replicated database dataUS8214444Nov 29, 2010Jul 3, 2012Commvault Systems, Inc.Email attachment management in a computer systemUS8234477Apr 28, 2009Jul 31, 2012Kom Networks, Inc.Method and system for providing restricted access to a storage mediumUS8239654Aug 18, 2011Aug 7, 2012Commvault Systems, Inc.Systems and methods for transferring data in a block-level storage operationUS8266106Nov 10, 2011Sep 11, 2012Commvault Systems, Inc.Systems and methods for performing storage operations using network attached storageUS8266397Dec 16, 2011Sep 11, 2012Commvault Systems, Inc.Interface systems and methods for accessing stored dataUS8271830Dec 18, 2009Sep 18, 2012Commvault Systems, Inc.Rolling cache configuration for a data replication systemUS8281028Feb 3, 2012Oct 2, 2012Commvault Systems, Inc.System and method for performing multistream storage operationsUS8285684Jan 22, 2010Oct 9, 2012Commvault Systems, Inc.Systems and methods for performing data replicationUS8290808Mar 7, 2008Oct 16, 2012Commvault Systems, Inc.System and method for automating customer-validated statement of work for a data storage environmentUS8290899Mar 28, 2007Oct 16, 2012Netapp, Inc.Group stamping style asynchronous replication utilizing a loosely-accurate global clockUS8296475Nov 13, 2009Oct 23, 2012Commvault Systems, Inc.Systems and methods for performing multi-path storage operationsUS8312323Dec 21, 2007Nov 13, 2012Commvault Systems, Inc.Systems and methods for remote monitoring in a computer network and reporting a failed migration operation without accessing the data being movedUS8321380Apr 30, 2009Nov 27, 2012Netapp, Inc.Unordered idempotent replication operationsUS8326915Jun 10, 2011Dec 4, 2012Commvault Systems, Inc.Pipeline systems and method for transferring data in a network environmentUS8346825Nov 2, 2009Jan 1, 2013Commvault Systems, Inc.Stored data reverification management system and methodUS8352422Mar 30, 2010Jan 8, 2013Commvault Systems, Inc.Data restore systems and methods in a replication environmentUS8352433Feb 9, 2010Jan 8, 2013Commvault Systems, Inc.Modular backup and retrieval system used in conjunction with a storage area networkUS8370542Sep 16, 2003Feb 5, 2013Commvault Systems, Inc.Combined stream auxiliary copy system and methodUS8380923 *Nov 8, 2010Feb 19, 2013Intel CorporationQueue arrays in network devicesUS8402219Jan 23, 2012Mar 19, 2013Commvault Systems, Inc.Hierarchical systems and methods for performing storage operations in a computer networkUS8417908Mar 2, 2012Apr 9, 2013Commvault Systems, Inc.Systems and methods for combining data streams in a storage operationUS8428995Sep 10, 2012Apr 23, 2013Commvault Systems, Inc.System and method for automating customer-validated statement of work for a data storage environmentUS8429428Jun 8, 2010Apr 23, 2013Commvault Systems, Inc.System and method for providing encryption in storage operations in a storage network, such as for use by application service providers that provide data storage servicesUS8433679Jun 9, 2008Apr 30, 2013Commvault Systems, Inc.Modular systems and methods for managing data storage operationsUS8463751Sep 16, 2011Jun 11, 2013Commvault Systems, Inc.Systems and methods for performing replication copy storage operationsUS8473690Oct 30, 2009Jun 25, 2013Netapp, Inc.Using logical block addresses with generation numbers as data fingerprints to provide cache coherencyUS8489656May 27, 2011Jul 16, 2013Commvault Systems, Inc.Systems and methods for performing data replicationUS8489841Dec 10, 2009Jul 16, 2013Western Digital Technologies, Inc.Manufacturing station dynamically configuring a data storage device with a validated configuration data recordUS8504515Mar 30, 2010Aug 6, 2013Commvault Systems, Inc.Stubbing systems and methods in a data replication environmentUS8504517Mar 29, 2010Aug 6, 2013Commvault Systems, Inc.Systems and methods for selective data replicationUS8504634May 31, 2012Aug 6, 2013Commvault Systems, Inc.Email attachment management in a computer systemUS8504741Sep 14, 2012Aug 6, 2013Commvault Systems, Inc.Systems and methods for performing multi-path storage operationsUS8566278Oct 13, 2011Oct 22, 2013Commvault Systems, Inc.Hierarchical systems and methods for performing data storage operationsUS8572038May 27, 2011Oct 29, 2013Commvault Systems, Inc.Systems and methods for performing data replicationUS8577844Sep 7, 2012Nov 5, 2013Commvault Systems, Inc.Systems and methods for performing storage operations using network attached storageUS8589347May 27, 2011Nov 19, 2013Commvault Systems, Inc.Systems and methods for performing data replicationUS8621115Jun 16, 2011Dec 31, 2013Western Digital Technologies, Inc.Configuring a data storage device with a configuration data record set in response to a configuration codeUS8645320May 24, 2012Feb 4, 2014Commvault Systems, Inc.System and method for performing an image level snapshot and for restoring partial volume dataUS20110010513 *Aug 2, 2007Jan 13, 2011International Business Machines CorporationStorage management system for preserving consistency of remote copy dataUS20110113197 *Nov 8, 2010May 12, 2011Intel CorporationQueue arrays in network devicesUS20120215994 *Apr 27, 2012Aug 23, 2012International Business Machines CorporationStorage management system for preserving consistency of remote copy dataWO2001015008A1 *Aug 25, 2000Mar 1, 2001Bullant Technology Pty LtdData record structure and method of operationWO2008121233A1 *Mar 19, 2008Oct 9, 2008Network Appliance IncGroup stamping style asynchronous replication utilizing a loosely-accurate global clock* Cited by examinerClassifications U.S. Classification711/113, 714/E11.118International ClassificationG06F11/14, G06F12/08Cooperative ClassificationG06F12/0866, G06F11/1402European ClassificationG06F11/14ALegal EventsDateCodeEventDescriptionApr 9, 2009FPAYFee paymentYear of fee payment: 12Jan 24, 2005FPAYFee paymentYear of fee payment: 8Jan 8, 2001FPAYFee paymentYear of fee payment: 4Mar 31, 1995ASAssignmentOwner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW YFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CANDELARIA, SUSAN KAY;LEGVOLD, VERNON JOHN;STANLEY, WARREN KEITH;REEL/FRAME:007475/0979Effective date: 19950330RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google


text:
BBC Radio 6 Music - Gideon Coe - Contact us The BBC has updated its cookie policy. We use cookies to ensure that we give you the best experience on our website. This includes cookies from third party social media websites if you visit a page which contains embedded content from social media. Such third party cookies may track your use of the BBC website. We and our partners also use cookies to ensure we show you advertising that is relevant to you. If you continue without changing your settings, we'll assume that you are happy to receive all cookies on the BBC website. However, you can change your cookie settings at any time. Continue Change settings Find out more ]]> Accessibility links Skip to content Accessibility Help BBC iD Notifications
Listen Playing: Only Happy When It Rains by Garbage BBC Radio 6 Music Gideon Coe Home Episodes Clips About Gideon Contact Contact details sms 64046 – text during show times only [Texts will be charged at your standard message rate. Check with your network provider for exact costs] email Email Gideon at gideon.6music@bbc.co.uk other Write to Gideon at BBC 6 Music, London, W1A 1AA twitter @BBCGidCoeShow You may also like View all Similar programmes By genre: Music > Classic Pop & Rock HomeShowsSchedulePlaylistMusic News {{/each}}

value: This website is the BBC's online service. It is a large network of websites including such high-profile sites as BBC News and Sport, the on-demand video and radio services co-branded BBC iPlayer, the children's sites CBBC and CBeebies, and learning services such as Bitesize.


text:
Fanny 1932 Film
Fanny is a 1932 French romance and drama film, directed by Marc Allégret based on the play by Marcel Pagnol. It is the second part in the Marseillaise film trilogy that started with Marius (1931) and concluded with César (1936). Like "Marius" the film was a box office success in France and today is still considered to be a classic of French cinema.
The story takes place in Marseille, where Marius, the son of a barkeeper César, has a romance with Fanny, neighbourhood girl of the fish sales man in the harbor. Marius dreams of sailing away one day and travel the seven seas. Fanny soon discovers she is pregnant of Marius, a shameful position in their community since she's a single mother with a father unable to secure the future of her and her child. She agrees with her mother and father's advice to marry a more prosperous salesman in the harbor, Honoré Panisse, who is 30 years older than she is. A few months after the marriage and the birth of the baby Marius returns and tries to win back Fanny...
This page contains text from Wikipedia, the Free Encyclopedia - https://wn.com/Fanny_(1932_film)
Latest News for: fanny (1932 film)
While Pagnol’s films — Marius (1931), Fanny (1932) and César (1936) — have been out of print for years on American home video, Janus Films has undertaken a 4K restoration ... Filmed in somewhat more subdued fashion by Marc Allégret, this chapter finds Fanny marrying Panisse, who dearly wants a son — only to have Marius return when the child is a toddler....