Sponsored Content
Top Forums Shell Programming and Scripting performance issue using gzcat, awk and sort Post 302240060 by Annihilannic on Thursday 25th of September 2008 02:00:05 AM
Old 09-25-2008
I usually find printf "%.f\n",variablename does the trick in awk.

sort usually has a command-line option to change the amount of memory it will allocate... usually the default is quite small, so you may see some benefit by increasing it. You can also sometimes control where it will store temporary files, so you may be able to specify some faster disks, or some that do not contain the original data so that they are not competing with each other. See man sort for details...
 

10 More Discussions You Might Find Interesting

1. UNIX for Advanced & Expert Users

Performance issue

Hello all, I just stuck up in an uncertain situation related to network performance... I am trying to access one of my remote client unix machine from a distant location.. The client machine is Ultra-5_10 , with SunOS 5.5.1 The ndd result ( hme1 )shows that the machine is hooked to a... (5 Replies)
Discussion started by: shibz
5 Replies

2. AIX

performance issue

We have a AIX v5.3 on a p5 system with a poor performing Ingres database. We added one CPU to the system to see if this would help. Now there are two CPU's. with sar and topas -P I see good results: CPU usage around 30% with topas I only see good results in the process output screen, the... (1 Reply)
Discussion started by: rein
1 Replies

3. UNIX for Advanced & Expert Users

performance issue

Hi, on a linux server I have the following : vmstat 2 10 procs memory swap io system cpu r b w swpd free buff cache si so bi bo in cs us sy id 0 4 0 675236 39836 206060 1617660 3 3 3 6 8 7 1 1 ... (1 Reply)
Discussion started by: big123456
1 Replies

4. Shell Programming and Scripting

gzcat into awk and then change FILENAME and process new FILENAME

I am trying to write a script that prompts users for date and time, then process the gzip file into awk. During the ksh part of the script another file is created and needs to be processed with a different set of pattern matches then I need to combine the two in the end. I'm stuck at the part... (6 Replies)
Discussion started by: timj123
6 Replies

5. Shell Programming and Scripting

Performance issue with awk script.

Hi, The below awk script is taking about 1 hour to fetch just 11 records(columns). There are about 48000 records. The script file name is take_first_uniq.sh #!/bin/ksh if then while read line do first=`echo $line | awk -F"|" '{print $1$2$3}'` while read line2 do... (4 Replies)
Discussion started by: RRVARMA
4 Replies

6. Solaris

Performance issue

Hi Gurus, I am beginner in solaris and want to know what are the things we need to check for performance monitoring on our solairs OS. for DISK,CPU and MEMORY. Also how we do ipforwarding in slaris Many thanks for your help Pradeep P (4 Replies)
Discussion started by: ppandey21
4 Replies

7. UNIX for Dummies Questions & Answers

Performance issue

hi I am having a performance issue with the following requirement i have to create a permutation and combination on a set of three files such that each record in each file is picked and the output is redirected in a specific format but it is taking around 70 odd hours to prepare a combination... (7 Replies)
Discussion started by: mad_man12
7 Replies

8. Shell Programming and Scripting

awk performance issue

Hi, I have the code below as cat <filename> | tr '~' '\n' | sed '/^$/ d' | sed "s/*/|/g" > <filename> awk -F\| -vt=`date +%m%d%y%H%M%S%s` '$1=="ST",$1=="SE"{if($1=="ST"){close(f);f="214_edifile_"t"" ++i} ; $1=$1; print>f}' OFS=\| <filename> This script replaces some characters and... (4 Replies)
Discussion started by: atlantis_yy
4 Replies

9. UNIX for Dummies Questions & Answers

awk script performance issue

Hello All, I have the below excerpt of code in my shell script and it taking long time to complete, though it prints the output quickly. Is there a way to make it come out once it finds the first instance as the file size of 4.7 GB it could be going through all lines of the data file to find for... (3 Replies)
Discussion started by: Ariean
3 Replies

10. UNIX for Dummies Questions & Answers

File sort performance

Hi, I have got a 9.3GB file and it is taking 1h 8min to sort file using the following code: sort -T /directory1 -t | -k9,9 -k8,8n /directory1/file1 > /directory2/file2 Is there a faster way of doing it please? Thanks Shash (10 Replies)
Discussion started by: shash
10 Replies
PSORT(3)						   BSD Library Functions Manual 						  PSORT(3)

NAME
psort, psort_b, psort_r -- parallel sort functions SYNOPSIS
#include <stdlib.h> void psort(void *base, size_t nel, size_t width, int (*compar)(const void *, const void *)); void psort_b(void *base, size_t nel, size_t width, int (^compar)(const void *, const void *)); void psort_r(void *base, size_t nel, size_t width, void *thunk, int (*compar)(void *, const void *, const void *)); DESCRIPTION
The psort(), psort_b(), and psort_r() functions are parallel sort routines that are drop-in compatible with the corresponding qsort() func- tion (see qsort(3) for a description of the arguments). On multiprocessor machines, multiple threads may be created to simultaneously per- form the sort calculations, resulting in an overall faster sort result. Overhead in managing the threads limits the maximum speed improve- ment to somewhat less that the number of processors available. For example, on a 4-processor machine, a typical sort on a large array might result in 3.2 times faster sorting than a regular qsort(). RESTRICTIONS
Because of the multi-threaded nature of the sort, the comparison function is expected to perform its own synchronization that might be required for data physically outside the two objects passed to the comparison function. However, no synchronization is required for the two object themselves, unless some third party is also accessing those objects. Additional memory is temporary allocated to deal with the parallel nature of the computation. Because of the overhead of maintaining multiple threads, the psort() family of routines may choose to just call qsort(3) when there is no advantage to parallelizing (for example, when the number of objects in the array is too small, or only one processor is available). Like qsort(3), the sort is not stable. RETURN VALUES
The psort(), psort_b() and psort_r() functions return no value. SEE ALSO
qsort(3) Mac OS X Nov 25, 2008 Mac OS X
All times are GMT -4. The time now is 11:05 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy