UNIX User's Reference Manual, 4.3 Berkeley Software Distribution, April 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....umbrella name SLI (pronounced sly) which is an acronym for Shared Library Interposer. SLI contains programs and utilities that enable application and library developers to monitor and analyze calls to shared library functions. SLI is intended to augment, not replace, analysis tools such as tcov [4,5,6,7], gprof [4,5,7] and analyzer [10] This section provides an overview of our technique and contrasts it to other techniques. 3.1. Overview of SLI s Technique What distinguishes SLI from traditional analysis tools is how it collects information and what infor Dynamically linked user application ....

....SLI (pronounced sly) which is an acronym for Shared Library Interposer. SLI contains programs and utilities that enable application and library developers to monitor and analyze calls to shared library functions. SLI is intended to augment, not replace, analysis tools such as tcov [4,5,6,7] gprof [4,5,7], and analyzer [10] This section provides an overview of our technique and contrasts it to other techniques. 3.1. Overview of SLI s Technique What distinguishes SLI from traditional analysis tools is how it collects information and what infor Dynamically linked user application SLI version of ....

[Article contains additional citation context not shown here]

"Unix User's Manual: Reference Guide", 4.2 Berkeley Software Distribution, March, 1984.

....gateways and will later be added by Berkeley. The EGP and route update functions are implemented as a user process. This facilitates development and distribution as only minor changes need to be made to the Unix kernel. This is a similar approach to the Unix route distrib ution program routed [Berkeley 83] which is based on the Xerox NS Ro uting Information Protocol [Xerox 81] 2.1 Routing Tables A route consists of a destination network number, the address of the next gateway to use on a directly connected network, and a metric givin g the distance in gateway hops to the destination network. ....

"Unix Programmer's Manual", Vol. 1, 4.2 Berkeley Sof tware Distribution, University of California, Berkeley.

....knew that she had joined up with his martini for 5 nothing was certain that the bullfighter should have tried to fool the matador s friend in a well lighted room and had not cheated the old beggar from Madrid while fast asleep. The number generator has one seed, hence just 2 32 possible states [13]. Consequently any text so generated can therefore be stored in 32 bits. The seed represents a very substantial compression (indeed, of a magnitude that has never previously been realized in text compression) This technique produces lossless codes for a particular class of texts: namely, those ....

Unix programmers manual. (1984) 4.2 Berkeley Software Distribution. Chapter 3C: RAND.

....NJ 201 5553145 . The format may be encoded as a regular expression: n) that is, a sequence of one or more non blank lines. The command to print Mr. Tic s entire record is then , x ( n) g Herbert Tic p and that to extract just the phone number is , x ( n) g Herbert Tic x [0 9] [0 9] n p The latter command breaks the file into records, chooses Mr. Tic s record, extracts the phone number from the record, and finally prints the number. A more involved problem is that of renaming a particular variable, say n, to num in a C program. The obvious first attempt, x n ....

..... The format may be encoded as a regular expression: n) that is, a sequence of one or more non blank lines. The command to print Mr. Tic s entire record is then , x ( n) g Herbert Tic p and that to extract just the phone number is , x ( n) g Herbert Tic x [0 9] [0 9] n p The latter command breaks the file into records, chooses Mr. Tic s record, extracts the phone number from the record, and finally prints the number. A more involved problem is that of renaming a particular variable, say n, to num in a C program. The obvious first attempt, x n c num ....

Unix Time-Sharing System Programmer's Manual, 4.1 Berkeley Software Distribution, Volumes 1 and 2C, University of California, Berkeley, Calif. 1981.

....of the storage hierarchy and reduce the load on the input output channels of the computer system. Many of the methods to be discussed in this paper are implemented in production systems. The UNIX utilities compact and compress are based on methods to be discussed in Sections 4 and 5 respectively [UNIX 1984]. Popular file archival systems such as ARC and PKARC employ techniques presented in Sections 3 and 5 [ARC 1986; PKARC 1987] The savings achieved by data compression can be dramatic; reduction as high as 80 is not uncommon [Reghbati 1981] Typical values of compression provided by compact are: ....

.... as high as 80 is not uncommon [Reghbati 1981] Typical values of compression provided by compact are: text (38 ) Pascal source (43 ) C source (36 ) and binary (19 ) Compress generally achieves better compression (50 60 for text such as source code and English) and takes less time to compute [UNIX 1984]. Arithmetic coding (Section 3.4) has been reported to reduce a file to anywhere from 12.1 to 73.5 of its original size [Witten et al. 1987] Cormack reports that data compression programs based on Huffman coding (Section 3.2) reduced the size of a large student record database by 42.1 when only ....

[Article contains additional citation context not shown here]

UNIX User's Manual. 1984. 4.2. Berkeley Software Distribution, Virtual VAX11 Version, University of California, Berkeley.

....environments. Any system that allows synchronous message passing and multiplexing can be used to construct a synchronous window system. The interprocess communication tools in most UNIX systems, particularly pipes plus the select or poll system calls, are sufficient to implement this design [UNIX 4BSD, UNIX SYSV] Although such a system would involve substantially more code than the Newsqueak version, it would still be conceptually simpler than a conventional window system. Conclusions Window systems are not inherently complex. They seem complex because we traditionally write them, and their ....

Unix Time-Sharing System Programmer's Manual, 4.3 Berkeley Software Distribution, University of California, Berkeley, Calif. 1986.

....knew that she had joined up with his martini for nothing was certain that the bullfighter should have tried to fool the matador s friend in a well lighted room and had not cheated the old beggar from Madrid while fast asleep. The number generator has one seed, hence just 2 32 possible states [13]. Consequently any text so generated can therefore be stored in 32 bits. The seed represents a very substantial compression (indeed, of a magnitude that has never previously been realized in text compression) This technique produces lossless codes for a particular class of texts: namely, those ....

Unix programmer's manual. (1984) 4.2 Berkeley Software Distribution. Chapter 3C: RAND.

....the interrupted thread and signal handler are co routines. 3. 1 System.Signals The structure System.Signals in the SML NJ pervasive environment provides a low level interface to the ML signal handling (see figure 1) There are a number of signals, corresponding to a subset of the UNIX signals [UNIX] plus a signal generated after garbage collections (SIGGC) A signal may be either be ignored or caught. The function setHandler is used to install a handler for a given signal, and the function inqHandler is used to get the current handler. A value of NONE for the handler in these operations ....

....SIGWINCH ignore window changed SIGUSR1 ignore user defined signal 1 SIGUSR2 ignore user defined signal 2 SIGTSTP n.a. currently unsupported SIGCONT n.a. currently unsupported SIGGC ignore garbage collection Table 1: Default signal actions these signals correspond to standard UNIX signals [UNIX] . The signals SIGTSTP and SIGCONT are currently unsupported, but will be implemented in the near future. SIGGC is generated following every garbage collection. 3.4 Handling SIGINT As we noted above, we implement a non standard policy for handling user interrupts. We decided on this policy after ....

[Article contains additional citation context not shown here]

UNIX programmer's reference manual, 4.3 Berkeley software distribution, April 1986.

....trace records to tape. No packet losses due to buffer overflows occurred during the Berkeley measurements. The USC data was collected using the NNStat program suite [9] on a Sun SparcServer 4 490. The NNStat package uses the standard SunOS timer, accessed through the gettimeofday( system call [16], which on that system has a 20 millisecond resolution. During tracing similar to that reported here, the loss rate was estimated by injecting a Poisson stream of short packets. Only 0.6 of these packets were missing from the tape. Bell Labs traffic was inspected with a DEC microVAX II configured ....

UNIX Programmer's Manual, 4.2 Berkeley Software Distribution, Computer Systems Research Group, Computer Science Division, University of California, Berkeley, California, 1984.

No context found.

UNIX User's Reference Manual, 4.3 Berkeley Software Distribution, April 1986.

No context found.

UNIX User's Reference Manual, 4.3 Berkeley Software Distribution, April 1986.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC