11-13-2011
Why not sell (some or all) those old units off. Build a new computer with a 4 or 6-core processor, lots of RAM, lots of hard drive space, multiple LAN cards and create multiple virtual machines?
Or if the workstations are powerful enough, you could probably set up virtualization in 5 machines with each machine running 1 real and 1 virtual machine. That's half the hardware but you still get 10 servers.
9 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I was wondering if anyone has used VMWare Workstation? I wanted to practice and learn Unix in a networking environment and have my own home lab. However room and money prevent me from buying several computers to do so. Any input would help thank you. (0 Replies)
Discussion started by: vedder191
0 Replies
2. Programming
In the following Shell Script can anyone help me?
What are the total scripts?
What are the total binaries?
What are the total files?
#!/bin/sh
GREP="/bin/grep -q"
if ; then
if ; then
for | in ${I}/* ;do
file ${I} | ${GREP} "executable" && echo "${I} is a binary"
file ${I} |... (1 Reply)
Discussion started by: rktompsett
1 Replies
3. Shell Programming and Scripting
heres the lab i did everything but when i issue the automated lab check.
but it gives me this everytime
''you are missing the /home/smichaels/Labs/lab2b/group file, please create it as per step 12 of the lab.
once you have corrected this problem, re-run the uli101.023 program''
im... (1 Reply)
Discussion started by: ink
1 Replies
4. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
''you are missing the /home/smichaels/Labs/lab2b/group file, please create it as per step 12 of the lab.
once... (4 Replies)
Discussion started by: ink
4 Replies
5. Shell Programming and Scripting
Write a script that copies the file tree (including subdirectories) in your home directory. As the initial directory to take the directory / usr / share / doc, as the destination directory using the directory $ {HOME} / doc.
Write a script corresponding to paragraph 1. Additional conditions: a)... (1 Reply)
Discussion started by: elginmulizwa
1 Replies
6. AIX
Unix Guys
i want to setup a lab in my house for learning, i want to setup and hacmp and a seperate server where i can setup 2 lpars and then cluster those 2 lpars and setup them up for failover
what is the cheapest way to achive this.
my objective is to learn hmc -> managed server via... (7 Replies)
Discussion started by: asyed123
7 Replies
7. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
Here are my directions. I am pretty sure I am doing this right, but I just want someone more experienced to look... (4 Replies)
Discussion started by: Jagst3r21
4 Replies
8. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
Filter a file for lines that have exactly 5 numbers in a row.
2. Relevant commands, code, scripts,... (13 Replies)
Discussion started by: herb bertz
13 Replies
9. AIX
Hi Everyone,
I'll be setting up a home lab for HACMP to play with it as much as I can and learn through out. I already have read old threads about it. My only concern is that I want to install an application on the nodes and then do a failover test to see if the application moves over. The... (4 Replies)
Discussion started by: uzair_rock
4 Replies
grammar::me_intro(n) Grammar operations and usage grammar::me_intro(n)
__________________________________________________________________________________________________________________________________________________
NAME
grammar::me_intro - Introduction to virtual machines for parsing token streams
DESCRIPTION
This document is an introduction to and overview of the basic facilities for the parsing and/or matching of token streams. One possibility
often used for the token domain are characters.
The packages themselves all provide variants of one virtual machine, called a match engine (short ME), which has all the facilities needed
for the matching and parsing of a stream, and which are either controlled directly, or are customized with a match program. The virtual
machine is basically a pushdown automaton, with additional elements for backtracking and/or handling of semantic data and construction of
abstract syntax trees (AST).
Because of the high degree of similarity in the actual implementations of the aforementioned virtual machine and the data structures they
receive and generate these common parts are specified in a separate document which will be referenced by the documentation for packages
actually implementing it.
The relevant documents are:
grammar::me_vm
Virtual machine specification.
grammar::me_ast
Specification of various representations used for abstract syntax trees.
grammar::me::util
Utility commands.
grammar::me::tcl
Singleton ME virtual machine implementation tied to Tcl for control flow and stacks. Hardwired for pull operation. Uninteruptible
during processing.
grammar::me::cpu
Object-based ME virtual machine implementation with explicit control flow, and stacks, using bytecodes. Suspend/Resumable. Push/pull
operation.
grammar::me::cpu::core
Core functionality for state manipulation and stepping used in the bytecode based implementation of ME virtual machines.
BUGS, IDEAS, FEEDBACK
This document, and the package it describes, will undoubtedly contain bugs and other problems. Please report such in the category gram-
mar_me of the Tcllib SF Trackers [http://sourceforge.net/tracker/?group_id=12883]. Please also report any ideas for enhancements you may
have for either package and/or documentation.
KEYWORDS
CFG, CFL, LL(k), PEG, TPDL, context-free grammar, context-free languages, expression, grammar, matching, parsing, parsing expression gram-
mar, push down automaton, recursive descent, top-down parsing languages, transducer, virtual machine
CATEGORY
Grammars and finite automata
COPYRIGHT
Copyright (c) 2005 Andreas Kupries <andreas_kupries@users.sourceforge.net>
grammar_me 0.1 grammar::me_intro(n)