Progress Database Setup, Maintenance and TuningProgress Database Setup, Maintenance and Tuning

Adam BackmanAdam Backman

V.P. of TechnologyV.P. of Technology

White Star SoftwareWhite Star Software

adam@wss.comadam@wss.com

AgendaAgenda

Progress architectureProgress architecture Hardware configuration discussionHardware configuration discussion Database maintenanceDatabase maintenance Performance tuningPerformance tuning Database future directionDatabase future direction

Database InternalsDatabase Internals

Internal BlocksInternal Blocks Data blocksData blocks Index blocksIndex blocks Other block types Other block types

Physical LayoutPhysical Layout Data storage areasData storage areas Primary recovery areaPrimary recovery area After image journalAfter image journal Other storageOther storage

Master BlocksMaster Blocks Data Block (RM Block)Data Block (RM Block) Index Block (Ix Block)Index Block (Ix Block) Index Anchor BlockIndex Anchor Block Free BlocksFree Blocks Empty BlocksEmpty Blocks

Database BlocksDatabase Blocks

This stores the “master” information for the This stores the “master” information for the database including:database including:

Area Status (opened, closed, crashed)Area Status (opened, closed, crashed) Last opened date & timeLast opened date & time High water mark for the areaHigh water mark for the area Last backup date & timeLast backup date & time

This information and more can be retrieved This information and more can be retrieved through the virtual system tables (VSTs)through the virtual system tables (VSTs)

Master BlockMaster Block

These are also known as RM (Record These are also known as RM (Record Manager) blocksManager) blocks

Can contain information from one or more Can contain information from one or more tablestables

They can be “full” (RM Blocks)They can be “full” (RM Blocks) Partially full (RM Chain blocks)Partially full (RM Chain blocks)

Data BlocksData Blocks

In most environments, records are mixed from In most environments, records are mixed from different tables in the same blockdifferent tables in the same block

Progress can store from 1 to 256 records per block Progress can store from 1 to 256 records per block per storage areaper storage area

All areas for a database must have the same block All areas for a database must have the same block size (1 – 8kb) size (1 – 8kb)

Total records per area is fixedTotal records per area is fixed More records per block equals lower total blocksMore records per block equals lower total blocks

Record StorageRecord Storage

Also known as IX blocksAlso known as IX blocks Only contain information from one indexOnly contain information from one index Always considered partially full, blocks Always considered partially full, blocks

will split to accommodate growthwill split to accommodate growth Each block contains the address of itself, Each block contains the address of itself,

the next and previous blocks to support the next and previous blocks to support forward and reverse searchesforward and reverse searches

Index BlocksIndex Blocks

Balanced B-treeBalanced B-tree Compressed dataCompressed data All data access* through indexAll data access* through index

*Except rowid access*Except rowid access

Index StructureIndex Structure

43-54 55-6532-41 86-9866-85

32-65 66-982-31

22-312-11 12-21

Record 65

Record 55

.

.

.

Record 41

Record 32

.

.

.

Record 54

Record 43

.

.

.

Record 98

Record 86

.

.

.

Record 85

Record 66

.

.

.

Record 31

Record 22

.

.

.

Record 11

Record 2

.

.

.

Record 21

Record 12

.

.

.

Progress Index Layout ExampleProgress Index Layout Example

Contain address information Contain address information No affiliation with IX or RM until utilized No affiliation with IX or RM until utilized Under high water mark of the databaseUnder high water mark of the database

Free BlocksFree Blocks

White spaceWhite space No addressesNo addresses Under total blocks of the database (area)Under total blocks of the database (area) Above high water markAbove high water mark

Empty BlocksEmpty Blocks

Data objectsData objects Control AreaControl Area Schema/Default AreaSchema/Default Area Primary recovery areaPrimary recovery area Application Data area(s)Application Data area(s)

Storage AreasStorage Areas

Index objectIndex object Table objectTable object Schema objectSchema object SequencesSequences

Storage Areas – Data ObjectsStorage Areas – Data Objects

Always has a .db extensionAlways has a .db extension Describes the “physical schema” or layout Describes the “physical schema” or layout

of the databaseof the database Lists storage areas and extents associated Lists storage areas and extents associated

with a databasewith a database Also known as the structure fileAlso known as the structure file

Control AreaControl Area

Also known as the “schema” areaAlso known as the “schema” area This is always area 6This is always area 6 All information that is not assigned a All information that is not assigned a

storage area will be stored herestorage area will be stored here All information is stored in this area if the All information is stored in this area if the

data is converted from version 8 with a data is converted from version 8 with a conv89conv89

Default Storage AreaDefault Storage Area

An area can contain 1 or more data objectsAn area can contain 1 or more data objects An area can have 1 or more extentsAn area can have 1 or more extents Tables and indexes can share areasTables and indexes can share areas These use area numbers 7-1000These use area numbers 7-1000

Application Data AreasApplication Data Areas

General informationGeneral information FormatFormat Reuse Reuse Same as bi file(s) in version 8 and earlierSame as bi file(s) in version 8 and earlier This is always area number 3This is always area number 3

Primary Recovery AreaPrimary Recovery Area

This process is automatic and can’t be This process is automatic and can’t be turned offturned off

This file is vital to database integrity both This file is vital to database integrity both physical and logicalphysical and logical

This file is generally sequentialThis file is generally sequential

Primary Recovery AreaGeneral InfoPrimary Recovery AreaGeneral Info

Each block is a clusterEach block is a cluster Each cluster contains information regarding Each cluster contains information regarding

transactions to allow transaction undo and transactions to allow transaction undo and redoredo

The transaction information is called notesThe transaction information is called notes Each note contains a transaction idEach note contains a transaction id

Primary Recovery AreaFormatPrimary Recovery AreaFormat

Clusters fill sequentiallyClusters fill sequentially When the last formatted cluster is reached When the last formatted cluster is reached

there is a reuse decision pointthere is a reuse decision point The “oldest” cluster is examined to The “oldest” cluster is examined to

determine if it can be reuseddetermine if it can be reused Then, either the oldest cluster is reused or Then, either the oldest cluster is reused or

another cluster is added, formatted and usedanother cluster is added, formatted and used

Primary Recovery AreaReusePrimary Recovery AreaReuse

The database engine can be serverlessThe database engine can be serverless The database engine can be multi-serverThe database engine can be multi-server Progress applications can be host-basedProgress applications can be host-based Progress applications can be 2-tier Progress applications can be 2-tier

client/serverclient/server Progress applications can be n-tier Progress applications can be n-tier

client/serverclient/server

Progress Memory ArchitectureProgress Memory Architecture

Buffers (-B)

Record locks (-L)

Index Cursors (-c)

After Image Buffers

Before Image Buffers

Hash Table

UserControlTable

ServerControlTable

Latch ControlTable

Other Stuff

Shared MemoryHost-based Configuration Shared MemoryHost-based Configuration

What are Latches?What are Latches?

Concurrency control mechanismConcurrency control mechanism Very course in old versions of ProgressVery course in old versions of Progress More granular in current versions of More granular in current versions of

ProgressProgress

Buffers (-B)

Record locks (-L)

Index Cursors (-c)

After Image Buffers

Before Image Buffers

Hash Table

UserControlTable

ServerControlTable

Latch ControlTable

Other Stuff

ListenSocket

Servers

Shared MemoryClient/Server ConfigurationShared MemoryClient/Server Configuration

Shared MemoryClient/Server ConfigurationShared MemoryClient/Server Configuration

ListenSocket

AppServer

DatabaseBrokerMemory

Servers

AppServer

Hardware ConfigurationsHardware Configurations

Disk ConsiderationsDisk Considerations Memory AllocationMemory Allocation CPU ConsiderationsCPU Considerations

In most environments disks are the largest In most environments disks are the largest area for improvement. All of the data flows area for improvement. All of the data flows from the disks to the other resources so this from the disks to the other resources so this effects both local and networked userseffects both local and networked users

Disk ContentionDisk Contention

Balancing disk I/O is the process of making Balancing disk I/O is the process of making sure you are using all of the available disk sure you are using all of the available disk resources (filesystems, disks and controllers) resources (filesystems, disks and controllers) are working equally as hard at load. This is are working equally as hard at load. This is also called eliminating also called eliminating variance. variance. A well A well tuned system will have less than a 15% tuned system will have less than a 15% variancevariance

Balancing Disk I/OBalancing Disk I/O

Operating system (swapping and paging)Operating system (swapping and paging) ProgressProgress

Database (DB and BI)Database (DB and BI) Application (code and temp files)Application (code and temp files)

Other applicationsOther applications

What Causes Disk I/O?What Causes Disk I/O?

RAID has many levels. I will only cover a RAID has many levels. I will only cover a fewfew

RAID 0: This level is also called RAID 0: This level is also called striping.striping. RAID 1: This is referred to as RAID 1: This is referred to as mirroringmirroring.. RAID 5: Most common RAID levelRAID 5: Most common RAID level RAID 10: This is mirroring and striping. RAID 10: This is mirroring and striping.

Also known as RAID 0 + 1Also known as RAID 0 + 1

What RAID Really MeansWhat RAID Really Means

Stripe 1Stripe 1Stripe 2Stripe 2Stripe 3Stripe 3Stripe 4 ...Stripe 4 ...

Disk 1Disk 1 Disk 2Disk 2 Disk 3Disk 3

Volume SetVolume Set

Disk Disk ArrayArray

Raid 0: StripingRaid 0: Striping

Good for read and write I/O performanceGood for read and write I/O performance No failover protectionNo failover protection Lower data reliability (1 fails they all fail)Lower data reliability (1 fails they all fail)

Raid 0: Striping (continued)Raid 0: Striping (continued)

PrimaryPrimary

ParityParity

Disk 1Disk 1 Disk 2Disk 2

Parity 1Parity 1 Parity 2Parity 2

Raid 1: MirroringRaid 1: Mirroring

OK for read and write applicationsOK for read and write applications Good failover protectionGood failover protection High data reliabilityHigh data reliability Most expensive in terms of hardwareMost expensive in terms of hardware

Raid 1: Mirroring (continued)Raid 1: Mirroring (continued)

This is the kiss of death for OLTP This is the kiss of death for OLTP performanceperformance

User information is stripedUser information is striped Parity information is striped WITH user Parity information is striped WITH user

informationinformation OK for 100% read only applicationsOK for 100% read only applications Poor performance for writesPoor performance for writes

Raid 5: Poor Man’s MirroringRaid 5: Poor Man’s Mirroring

Good for read and write applicationsGood for read and write applications High level of data reliability though not as High level of data reliability though not as

high as RAID 1 due to stripinghigh as RAID 1 due to striping Just as expensive as RAID 1Just as expensive as RAID 1

Raid 10: Mirroring and StripingRaid 10: Mirroring and Striping

Manual spread of data across non-striped Manual spread of data across non-striped disksdisks

Better control as you can see where the I/O Better control as you can see where the I/O is goingis going

More attention by system administrator is More attention by system administrator is neededneeded

Software Methods for I/O DistributionSoftware Methods for I/O Distribution

Progress multi-volumeProgress multi-volume Progress storage areasProgress storage areas 8K database block size8K database block size BI Cluster sizeBI Cluster size Use page writersUse page writers Move the temp-file I/O with -TMove the temp-file I/O with -T Location of application filesLocation of application files Use of program libraries to reduce I/OUse of program libraries to reduce I/O

OptionsOptions

• Progress-specific way to distribute I/OProgress-specific way to distribute I/O• Only way to eliminate I/O indirection in a Only way to eliminate I/O indirection in a

Progress environmentProgress environment• Only way to pre-allocate database blocksOnly way to pre-allocate database blocks• Every database is multi-volume in Progress Every database is multi-volume in Progress

version 9version 9

Multi-Volume DatabaseMulti-Volume Database

BenefitsBenefits Greater control of location of dataGreater control of location of data Minimize downtime for utilitiesMinimize downtime for utilities Stripe some, leave some on straight disksStripe some, leave some on straight disks

DrawbacksDrawbacks More things to breakMore things to break More complex to monitorMore complex to monitor

Storage AreasStorage Areas

A storage area can hold 1 or more data A storage area can hold 1 or more data objects (index, table, schema, …)objects (index, table, schema, …)

Separate schema from data if possibleSeparate schema from data if possible Try to keep the number of areas Try to keep the number of areas

manageable, only add more areas for valid manageable, only add more areas for valid business reasonsbusiness reasons

Storage Areas - ControlStorage Areas - Control

Smaller data areas allow utilities, such as off Smaller data areas allow utilities, such as off line index rebuild, to run faster as they have line index rebuild, to run faster as they have less blocks to scanless blocks to scan

Minimize DowntimeMinimize Downtime

Database Administration ToolsDatabase Administration Tools

Backup and restoreBackup and restore After image journalingAfter image journaling Other UtilitiesOther Utilities

ProsPros Progress awareProgress aware Supports online backupSupports online backup easyeasy

ConsCons Slower than OS methodsSlower than OS methods Does not backup more than the databaseDoes not backup more than the database

probkupprobkup

Utility to restore a Progress backupUtility to restore a Progress backup Can restore to a different structure provided Can restore to a different structure provided

there are enough storage areasthere are enough storage areas

Syntax:Syntax:

prorest prorest dbnamedbname device_or_filename device_or_filename [-list | [-list | -vp | -vf]-vp | -vf]

prorestprorest

ProsPros Allows you to recover to present Allows you to recover to present Recover from media failureRecover from media failure Only way to “repair” catastrophic user errorOnly way to “repair” catastrophic user error

ConsCons Additional point of failureAdditional point of failure Adds complexity to the systemAdds complexity to the system Performance impactPerformance impact

After ImagingAfter Imaging

FOR EACH CUSTOMER: FOR EACH CUSTOMER:

UPDATE CUSTOMER.UPDATE CUSTOMER.

END. END. After image note written

Before image note written

How After Imaging WorksHow After Imaging Works

In conjunction with a backup siteIn conjunction with a backup site To update a report serverTo update a report server As a means of backupAs a means of backup

How to Integrate After ImagingHow to Integrate After Imaging

Poor man’s replicationPoor man’s replication Allows for periodic update of a copy of the Allows for periodic update of a copy of the

databasedatabase The copy can then be backed up with a The copy can then be backed up with a

conventional backup mechanismconventional backup mechanism

AI to Update a Backup SiteAI to Update a Backup Site

AI to Update a Report ServerAI to Update a Report Server

Similar to keeping a backup siteSimilar to keeping a backup site Requires two copies of the database in Requires two copies of the database in

addition to the original (one for update and addition to the original (one for update and a second for reporting)a second for reporting)

The reporting database is a copy of the The reporting database is a copy of the backup that is done periodically to keep the backup that is done periodically to keep the data synchronizeddata synchronized

Not generally a good ideaNot generally a good idea Increased recovery timeIncreased recovery time Reduced reliability Reduced reliability

Backup the database each weekendBackup the database each weekend Backup the AI file(s) each weeknight Backup the AI file(s) each weeknight

AI as a Means of BackupAI as a Means of Backup

Index rebuildIndex rebuild idxbuildidxbuild idxfixidxfix idxcompactidxcompact

DB analysisDB analysis

Progress® UtilitiesProgress® Utilities

Truncate BITruncate BI BI GrowBI Grow Table moveTable move Index moveIndex move Database log truncationDatabase log truncation

Progress® Utilities (continued) Progress® Utilities (continued)

Can only be run on a database that has been Can only be run on a database that has been shutdownshutdown

Can be run on 1 or more indexesCan be run on 1 or more indexes

Syntax: Syntax:

proutil <dbname> -C idxbuild [-TB proutil <dbname> -C idxbuild [-TB nn] ] [-TM [-TM nn] [-T ] [-T dirnamedirname]]

idxbuildidxbuild

Verifies index to record linkageVerifies index to record linkage Verifies index block to index block linkageVerifies index block to index block linkage Works online while in multi-user modeWorks online while in multi-user mode

Syntax: Syntax:

proutil <dbname> -C idxfixproutil <dbname> -C idxfix

idxfixidxfix

Fast way to compress (reorganize) indexes onlineFast way to compress (reorganize) indexes online Utility will pass through the index several times Utility will pass through the index several times

(number of index levels + 1)(number of index levels + 1) Runs onlineRuns online

Syntax: Syntax:

proutil <dbname> -C idxcompact [owner-proutil <dbname> -C idxcompact [owner-name.]table-name.index-name [n] name.]table-name.index-name [n]

idxcompactidxcompact

ixanalys – analysis of indexes ixanalys – analysis of indexes chanalys – analysis of record chainschanalys – analysis of record chains dbanalys – analysis of records and indexesdbanalys – analysis of records and indexes

Syntax: Syntax:

proutil <dbname> -C XXanalysproutil <dbname> -C XXanalys

Database AnalysisDatabase Analysis

Reduce for size of the BI fileReduce for size of the BI file Change the cluster size of the BI fileChange the cluster size of the BI file Change the block size of the BI fileChange the block size of the BI file

Syntax: Syntax:

proutil <dbname> -C truncate bi [-bi proutil <dbname> -C truncate bi [-bi nn] ]

[-biblocksize [-biblocksize nn] [-G ] [-G nn]]

Truncate BITruncate BI

After truncation it is best to pre-grow your After truncation it is best to pre-grow your BI file to it’s anticipated sizeBI file to it’s anticipated size

Keeps BI sequential (good for performance)Keeps BI sequential (good for performance) Database must be shutdownDatabase must be shutdown

Syntax: Syntax:

proutil <dbname> -C bigrow proutil <dbname> -C bigrow nn

BI GrowBI Grow

Allows the movement from one storage Allows the movement from one storage area to anotherarea to another

Works “online”Works “online” Uses 4-times the amount of BI space as is Uses 4-times the amount of BI space as is

taken up by the tabletaken up by the tableSyntax: Syntax:

proutil <dbname> -C tablemove [owner-proutil <dbname> -C tablemove [owner-name.]table-name table-area [index-area]name.]table-name table-area [index-area]

Table MoveTable Move

Allows movement of indexes from one storage Allows movement of indexes from one storage area to anotherarea to another

Works “online”Works “online” Uses a significant amount of BI spaceUses a significant amount of BI space

Syntax: Syntax:

proutil db-name -C indexmove [owner-proutil db-name -C indexmove [owner-name.]table-name.index-name area-name name.]table-name.index-name area-name

Index MoveIndex Move

Reduces the size of the log fileReduces the size of the log file Database must be down for it to work Database must be down for it to work

Syntax: Syntax:

prolog <dbname>prolog <dbname>

Database Log TruncationDatabase Log Truncation

Performance Tuning - BasicsPerformance Tuning - Basics

Before Image cluster sizeBefore Image cluster size Database block sizeDatabase block size Tuning APWsTuning APWs Memory tipsMemory tips Increasing CPU efficecyIncreasing CPU efficecy

Keep things localKeep things local No temp files on network drivesNo temp files on network drives Move the application “close” to the userMove the application “close” to the user

Use -cache to speed initial connectionUse -cache to speed initial connection Use -pls if you are using program libraries Use -pls if you are using program libraries

over the networkover the network Application issues are magnified over a Application issues are magnified over a

network (field-lists, no-lock, indexes, …) network (field-lists, no-lock, indexes, …)

Networking TipsNetworking Tips

-Mm 8192 to increase the tcp packet size -Mm 8192 to increase the tcp packet size from 1k to 8kfrom 1k to 8k

-Ma Increase the number of servers to -Ma Increase the number of servers to reduce or eliminate server contentionreduce or eliminate server contention

Networking Tips (Continued)Networking Tips (Continued)

Tables that are accessed sequentially may Tables that are accessed sequentially may benefit from being isolated to their own table benefit from being isolated to their own table spacespace

Randomly accessed tables will generally Randomly accessed tables will generally perform better on striped volumesperform better on striped volumes

Disk systems that have read ahead algorithms Disk systems that have read ahead algorithms will help sequential access most when placed will help sequential access most when placed on a single disk (or mirror)on a single disk (or mirror)

Stripe Some, Leave Others FlatStripe Some, Leave Others Flat

Most systems will benefit from using 8k Most systems will benefit from using 8k block size (NT should use 4k)block size (NT should use 4k)

You will retrieve more information per You will retrieve more information per physical I/O especially on index readsphysical I/O especially on index reads

I/O is done how the operating likes it to be I/O is done how the operating likes it to be donedone

8k Block Size8k Block Size

Somewhere between 1MB and 4MB works for Somewhere between 1MB and 4MB works for most peoplemost people

If you are checkpointing every 2 minutes or more If you are checkpointing every 2 minutes or more often during peak periods increase the cluster sizeoften during peak periods increase the cluster size

If you a “workgroup” version of Progress leave If you a “workgroup” version of Progress leave your cluster size alone (512kb)your cluster size alone (512kb)

Don’t forget to use bigrow to avoid allocating Don’t forget to use bigrow to avoid allocating clusters one at a timeclusters one at a time

BI Cluster SizeBI Cluster Size

Every database that does updates should Every database that does updates should have a before image writer (BIW)have a before image writer (BIW)

Every database that does updates should Every database that does updates should have at least 1 asynchronous page writer have at least 1 asynchronous page writer (APW)(APW)

Every database that is using after imaging Every database that is using after imaging should have a after image writer (AIW) should have a after image writer (AIW)

Progress® Page WritersProgress® Page Writers

Start with 1 APWStart with 1 APW Monitor buffers flushed at checkpoint on Monitor buffers flushed at checkpoint on

the activity screen (option 5) in promonthe activity screen (option 5) in promon If buffers flushed increases during the If buffers flushed increases during the

“important” hours of the day add 1 APW“important” hours of the day add 1 APW

Tuning APWsTuning APWs

Local (host based) users and batch jobs Local (host based) users and batch jobs should use the -T parameter to place their should use the -T parameter to place their temporary file (.srt, .pge, .lbi, …) I/O on a temporary file (.srt, .pge, .lbi, …) I/O on a drive that is not working as hard as the drive that is not working as hard as the other drives on the systemother drives on the system

Note: -T should never point to a network Note: -T should never point to a network drivedrive

Use -T to Level Disk I/OUse -T to Level Disk I/O

Keep paths shortKeep paths short say run <subdir>/program to eliminate say run <subdir>/program to eliminate

unnecessary searchesunnecessary searches Put programs into libraries (prolib) to Put programs into libraries (prolib) to

reduce I/O to temp filesreduce I/O to temp files Libraries use a hashed search mechanism Libraries use a hashed search mechanism

for better performancefor better performance

Application FilesApplication Files

Memory should be used to reduce disk I/O. Memory should be used to reduce disk I/O. Broker (server) side parameters should be Broker (server) side parameters should be tuned first and then user parameters can be tuned first and then user parameters can be modified. In a memory lean situation, modified. In a memory lean situation, memory should be taken away from memory should be taken away from individual users before reducing broker individual users before reducing broker parametersparameters

Memory ContentionMemory Contention

Swapping is bad, buy more memory or Swapping is bad, buy more memory or reduce parameters to avoid itreduce parameters to avoid it

Increase -B in 10% increments until the Increase -B in 10% increments until the point of diminishing returns or swapping, point of diminishing returns or swapping, whichever comes firstwhichever comes first

Use V9 private buffers (-Bp) for reportingUse V9 private buffers (-Bp) for reporting Do not use private buffers (-I) prior to V9Do not use private buffers (-I) prior to V9

Memory HintsMemory Hints

Use memory for the users closest to the Use memory for the users closest to the customer first (developers increase last)customer first (developers increase last)

Use -Bt for large temp tablesUse -Bt for large temp tables Set -bibufs between 50 and 120. Look at Set -bibufs between 50 and 120. Look at

the activity screen in promon (BI buffer the activity screen in promon (BI buffer waits) to see if additional tuning is waits) to see if additional tuning is necessary. Start with 50 as this will work necessary. Start with 50 as this will work for the vast majority of peoplefor the vast majority of people

Memory Hints(continued)Memory Hints(continued)

High CPU activity is not bad in and of itself High CPU activity is not bad in and of itself but high system CPU activity is bad and but high system CPU activity is bad and should be correctedshould be corrected

CPU ContentionCPU Contention

USER - This is what you paid forUSER - This is what you paid for SYSTEM - This is overheadSYSTEM - This is overhead WAIT - This is wasteWAIT - This is waste IDLE - This is nothing ;-)IDLE - This is nothing ;-)

Components of CPU ActivityComponents of CPU Activity

The goal is to have as much USER time as The goal is to have as much USER time as possible with as little SYSTEM and WAITpossible with as little SYSTEM and WAIT

A practical split is USER: A practical split is USER: 70%70%

SYSTEM:SYSTEM: 20%20%

WAIT:WAIT: 0% 0%

IDLE: IDLE: 10%10%

CPU Activity GoalsCPU Activity Goals

Always use -spinAlways use -spin Use a setting of 1 for single CPU systemsUse a setting of 1 for single CPU systems Use a higher setting for multiple CPU systemsUse a higher setting for multiple CPU systems

Testing has shown that the optimal setting for -Testing has shown that the optimal setting for -spin is somewhere between 2000 and 10000. First spin is somewhere between 2000 and 10000. First try 2000try 2000

-napmax should default to 5000 but in some late 7 -napmax should default to 5000 but in some late 7 and early 8 versions of Progress it is set to 100 and early 8 versions of Progress it is set to 100 which is way too lowwhich is way too low

Eliminating High SYSTEMCPU ActivityEliminating High SYSTEMCPU Activity

WAIT = Waiting on I/OWAIT = Waiting on I/O If you still have IDLE time it generally is If you still have IDLE time it generally is

not a big problemnot a big problem Look at paging/swapping firstLook at paging/swapping first Next look at your disk I/ONext look at your disk I/O

Eliminating High WAITCPU ActivityEliminating High WAITCPU Activity

Progress Database Future DirectionsProgress Database Future Directions

Increased uptime through online utilitiesIncreased uptime through online utilities Increased speed of utilities to maintain the Increased speed of utilities to maintain the

databasedatabase Support for clusters to increase reliabilitySupport for clusters to increase reliability Open standards supportOpen standards support

ReplicationReplication

New feature in 9.1D of ProgressNew feature in 9.1D of Progress Fathom High AvailabilityFathom High Availability Allows for single or bi-directional Allows for single or bi-directional

replicationreplication Target database can be used for update or Target database can be used for update or

reportingreporting

Replication (continued)Replication (continued)

Source database has an agent that forwards Source database has an agent that forwards changes to the target database(s)changes to the target database(s)

Only one agent per databaseOnly one agent per database One or more targets per agentOne or more targets per agent Raw record format is used to increase Raw record format is used to increase

performance and reduce overheadperformance and reduce overhead

QuestionsQuestions