10-27-2014
enhanced concurrent VGs are mostly used on hacmp/powerHA systems. In a two node system, this VG works active for one node and passive for the other. All changes made on LVs on node1 are update on node2 (lazzy update)..
concurrent VGs can not be shared with teo or more nodes..
A good explanation is here:
http: //unix.ittoolbox.com/groups/technical-functional/ibm-aix-l/concurrent-and-enhanced-concurrent-vgs-4089500
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Can someone guide me in telling me what is a good definition of concurrent users. Is there a website I can go to to get this definition? (2 Replies)
Discussion started by: mpshaw
2 Replies
2. Filesystems, Disks and Memory
Hi
I am fairly new to the Unix environment and need to understand how Unix handles concurrent access to files and how it differs to Win NT.
Any help would be greatly appriciated :) (1 Reply)
Discussion started by: beechwood
1 Replies
3. UNIX for Advanced & Expert Users
Hi,
I notice in my Sun Solaris 8 sparc workstatin, I am able to login concurrently using a same user ID.
Is there a way to disallow this? That is, at anyone time, the user can have only 1 login session.
How can it be done?
Thanks (10 Replies)
Discussion started by: champion
10 Replies
4. Shell Programming and Scripting
Hi
I have a ksh that can have multiple instances running at the same time.
The script (each instance) uses the SAME log file to write to.
Should this cause a problem or is the ksh clever enough to queue write requests to the file?
Thanks.
GMMIKE (2 Replies)
Discussion started by: GNMIKE
2 Replies
5. IP Networking
Just like concurrent tcp server, anyone know how to design the concurrent udp server with the thread? it's best to give some basic examples,thanks (0 Replies)
Discussion started by: Frank2004
0 Replies
6. Shell Programming and Scripting
We have a very large text file..contains almost 100K lines.
We want to process this file to generate another text file as per our data requirement.
As for now the parsing of data takes 20-25 mins each , for 100K lines.
the current script uses :
While Read Each Line
do parsing..
Done
... (6 Replies)
Discussion started by: Amruta Pitkar
6 Replies
7. AIX
Hi,
on normal (non concurrent) vgs, it's possible to extend a lun on san-storage , and use chvg -g to rewrite vgda, and use disks with the new size for lvm operations
is the same procedure possbile on a hacmp-cluster (2 node in our case) with concurrent vgs in active/passive mode?
cheers... (5 Replies)
Discussion started by: funksen
5 Replies
8. Linux
Hi Guys,
I just wondering if any of the AIX gurus with some exposure to Linux Redhat can tell me whether in Linux ( Red Hat or OpenSuse ) we have a similar option/capability like the CIO (Concurrent I/O) which is currently available on AIX. The reason I'm asking is because in the past we... (2 Replies)
Discussion started by: arizah
2 Replies
9. Shell Programming and Scripting
Hi all,
I have a folder with sql files that need to be inserted in a DB with SQL*Plus. The thing is that it takes too long to insert them all one by one, so I want to insert them five at a time.
Currently what I use is this:
for $FILENAME in *.sql
do
sqlplus -s $DBUSER@$SID << EOF
... (0 Replies)
Discussion started by: Tr0cken
0 Replies
10. AIX
Hi All,
I am going to perform some activity in 2Node HA Server(Active/Passive).
For that i have to do some pre-requsite (ie., Resource Group VG's should be Enhanced-Concurrent)
In my setup, we have two volume groups in one RG. In that one VG is Normal and another is Enhance Concurrent.
... (2 Replies)
Discussion started by: Thala
2 Replies
LEARN ABOUT DEBIAN
dispatch_benchmark_f
dispatch_benchmark(3) BSD Library Functions Manual dispatch_benchmark(3)
NAME
dispatch_benchmark -- Measures block execution time
SYNOPSIS
#include <dispatch/dispatch.h>
uint64_t
dispatch_benchmark(size_t count, void (^block)(void));
uint64_t
dispatch_benchmark_f(size_t count, void *context, void (*function)(void *));
DESCRIPTION
The dispatch_benchmark() function executes the given block multiple times according to the count variable and then returns the average number
of nanoseconds per execution. This function is for debugging and performance analysis work. For the best results, pass a high count value
to dispatch_benchmark(). When benchmarking concurrent code, please compare the serial version of the code against the concurrent version,
and compare the concurrent version on different classes of hardware. Please look for inflection points with various data sets and keep the
following facts in mind:
o Code bound by computational bandwidth may be inferred by proportional changes in performance as concurrency is increased.
o Code bound by memory bandwidth may be inferred by negligible changes in performance as concurrency is increased.
o Code bound by critical sections may be inferred by retrograde changes in performance as concurrency is increased.
o Intentional: locks, mutexes, and condition variables.
o Accidental: unrelated and frequently modified data on the same cache-line.
RETURN VALUE
The dispatch_benchmark() function returns the average number of nanoseconds the given block takes to execute.
SEE ALSO
dispatch(3)
Darwin May 1, 2009 Darwin