HDTenEightyP/NetNews huggingface dataset:
From: hire_cs (administrative account for cs hiring)
Newsgroups: comp.os.research
Subject: POSTDOC Position/University of California Riverside/One year
Date: 11 Nov 1992 16:19:30 GMT
Organization: University of California, Santa Cruz
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp

We are seeking to hire a postdoc to visit our Department's distributed 
systems group (for a year).  The target start date for this position 
will be Jan 15th, 1993.  Interested applicants should apply quickly because
of funding constraints.

To qualify for this position, you should have research experience in operating
systems, distributed systems, parallel systems, languages, or 
some related area, and have some publications in these areas.
Systems people are strongly encouraged to apply.  Applicants with experience
in OS kernel development are preferred since the work that we focus on has
a strong experimental emphasis. Our research focuses on 
distributed shared memory(DSM), reliability aspects for DSM systems,
and we are looking into pursuing multimedia advances in conjunction 
with a larger UC project.  

The Department is located at the University of California, Riverside which 
is about 60 miles east of Los Angeles.  The University 
of California, Riverside is a small campus belonging to
the University of California system.  The current enrollment is 8,900 of 
which 20% are graduate stduents.  The student/faculty ratio of 14 to 1
is the smallest in the entire UC system, and one of the smallest in 
the nation.  UCR is located in the state's fastest growing 
county and is situated on a 1,200 acre park-like campus at the 
edge of the city of Riverside.  The campus has been growing during the
last several years, and the enrollment is expected to grow to 20,000
by the year 2005.

Prospective applicants should send a full curriculum vitae, including the 
following information (same information as A. Tannenbaum recently required
to make it simple):

  - Name:
  - Home and work addresses and phone numbers:
  - Email and FAX addresses:
  - Age/Marital status/children:
  - B.S.: institution, date, major
  - M.S.: institution, date, major, thesis title, supervisor's name
  - Ph.D: institution, date, major, thesis title, supervisor's name
  - Computer systems/languages you know well:
  - Three professional references (name, phone #, email address):
  - Proposed starting date (should be around Jan. 15, 1993)
  - Current position, employer, and duties:
  - Previous work history:
  - Publications;
  - A short summary of your current research interests:

Please send either a troff -ms file, or flat ASCII text or PostScript.
ALSO, send hardcopies of the information above to the address shown below.

PLEASE USE THE EMAIL ADDRESS: hire_cs@cs.ucr.edu
-----------------------------------------------
Brett D. Fleisch
Assistant Professor	
Department of Computer Science
University of California
Riverside, CA 92521 - 0304

Phone:(714)787-7206
FAX:(714)787-4643
brett@cs.ucr.edu
From: ashley@citr.uq.oz.au (Ashley Beitz)
Newsgroups: comp.os.research
Subject: Distributed Systems Technology Research Position
Date: 9 Nov 1992 21:39:12 GMT
Organization: Prentice Centre, University of Queensland
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp



                       Cooperative Research Centre for 

                        Distributed Systems Technology

                              Brisbane, Australia


                 trading as DSTC Pty Ltd, A.C.N. 052 372 577


--------------------------------------------------------------------------
                               RESEARCH SCIENTIST
--------------------------------------------------------------------------


The Cooperative Research Centre for Distributed Systems Technology has 
been established under an Australian Government programme with initial 
Government and industry funding of $A54 million over 7 years.  It will 
develop technologies that will form infrastructure for global 
distributed information systems and services.  


The Position:

The person employed in this position will be investigating the 
application of encryption for distributed and open systems.  You will be 
responsible for investigating the possible usage of encryption in 
distributed and open systems, determining the required algorithms, and 
designing appropriate protocols for the secure and efficient usage of 
these algorithms.  The research will be conducted as part of a team in 
the Management, Security and Performance Unit of the CRC for Distributed 
Systems Technology's site at the Queensland University of Technology.
Applicants should have a PhD with a strong background in cryptology, 
extensive programming experience and an interest in applying information 
security techniques to distributed systems.  Development or industrial 
experience is advantageous.


Terms:

The appointment will be for a initial period of 3 years, commencing in 
early 1993.  Salary: $A40,000 - $A50,000 per annum.  For further 
information, contact Assoc. Prof. Ed Dawson, Ph: +61(7)864.1937, Fax: 
+61(7)221.2384, Internet: e.dawson@qut.edu.au.

Written applications should include names, addresses and fax numbers for 
2 referees and should be addressed to Rob Cook, CEO, DSTC Pty Ltd, The 
University of Queensland, Queensland, 4072, Australia,
Fax: +61(7)365 4399.  Applications close on 4th December, 1992.
--------------------------------------------------------------------------
Ashley Beitz		  | CiTR			|ashley@citr.uq.oz.au
                          | University of Queensland	|voice: +61 7 365 4309
			  | St Lucia, Queensland 4072	|fax:   +61 7 365 4399
			  | Australia			|
From: rlarowe@chpcchpc.org (Rick LaRowe)
Newsgroups: comp.os.research
Subject: Re: Difference between DYNAMIC and ADAPTIVE load balancing???
Date: 6 Nov 1992 21:03:54 GMT
Organization: Center For High Perf. Computing of WPI; Marlboro Ma
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp


In article <1dbi73INNm41@darkstar.UCSC.EDU> xander@paramount.nikhefk.nikhef.nl (Xander Evers) writes:

>The terms dynamic scheduling and adaptive scheduling are sometimes used 
>in the literature in an inconsistent manner. A dynamic schedular takes 
>into account the current state of affairs as it perceives it in the system.

It appears to me that the difference between a dynamic and an adaptive
algorithm or policy is largely a question of whether you use the latest
buzzword or not.  Say I've got two "dynamic" algorithms A and B, each
with a couple of parameters that affect their behavior.  Based upon
some of the responses to the original post on this topic, lots of folks
would not consider these "adaptive" policies, even if they "react" to
the system state.  But if I go and create policy C that uses some new
parameter values to select between policies A and B, it suddenly
becomes "adaptive", because the "basic control flow of the policy
changes in reaction to system state."  But had I originally gone out
and implemented the basic functionality of policy C without mentioning
policies A and B, my description to it would have sounded alot like the
description I just gave for A and B (namely, they have parameters that
affect the way the policy behaves given certain system conditions).

So my question to the folks who claim there is really a difference;
where do you draw the line?  When is a reaction to a change in system
state part of the basic algorithm, and when is it a change in the basic
control flow of the policy?  In particular, I'd be curious to know
whether the NUMA memory management policy we (Carla Ellis and I)
studied in our SOSP '91 paper is dynamic or adaptive.  We called it
dynamic (adaptive wasn't such a hot buzzword when we started that work
8-)), but given the extent to which its behavior can change (sometimes
replicating, sometime migrating, sometimes using remote reference
depending on the workload encountered), I can imagine calling in
adaptive.

Anyway, if there is a difference between dynamic and adaptive, I'd
certainly like to see a clearer definition.

Rick LaRowe
------------------------------------------------------------------------------
Center for High Performance Computing       internet: rlarowe@chpc.org
Worcester Polytechnic Institute                       rlarowe@wpi.edu
Suite 170			               phone: (508) 624-7400 x610
293 Boston Post Road West			      (508) 831-5837 (campus)
Marlborough, MA 01752				      (508) 624-6354 (fax)
------------------------------------------------------------------------------
From: mehra@aquinas.crhc.uiuc.edu (Pankaj Mehra)
Newsgroups: comp.os.research
Subject: Re: Difference between DYNAMIC and ADAPTIVE load balancing???
Date: 6 Nov 1992 21:04:26 GMT
Organization: University of Illinois at Urbana-Champaign
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp

A DYNAMIC load-balancing policy is one that uses run-time state
information in making scheduling decisions.

There are two kinds of dynamic policies: ADAPTIVE and non-adaptive. The
latter always use the same (fixed, load-dependent) policy; the former
may adjust policy parameters in order to gradually improve their
performance.

The key point is that while non-adaptive policies use only the
information about the run-time state (`load'), adaptive policies use
that plus information about current performance (`speed-up').

In adaptive policies, the rules for adjusting policy parameters may be
static or dynamic. An example of the former will be: "shift to a
conservative migration rule when system-wide load patterns are varying
too rapidly." An example of the latter will be: "increase sender-side
threshold when migrated jobs cause slowdown rather than speed-up." Some
researchers refer to the performance-driven adaptation exhibited by the
second policy as "learning."

Since both non-adaptive policies and adaptive policies with static
rules really use only load information, it is confusing to distinguish
between them.  One way to avoid such confusion is to RESTRICT THE USE
OF THE WORD `ADAPTIVE' TO POLICIES THAT USE PERFORMANCE FEEDBACK in
order to drive their adjustment of policy parameters. EXAMPLES of
adaptive policies (in this restricted sense of the word `adaptive') are:

%K MTS90
%A R. Mirchandaney
%A D. Towsley
%A J. A. Stankovic
%T Adaptive Load Sharing in Heterogeneous Distributed Systems
%J J. Parallel and Distributed Computing
%V 9
%P 331-346
%I Academic Press, Inc.
%D 1990

%K MeW92
%A P. Mehra
%A B. W. Wah
%T Adaptive Load-Balancing Strategies for Distributed Systems
%J Proc. 2nd Int'l Conf. on Systems Integration
%I IEEE Computer Society
%C Morristown, NJ
%D June 1992
%P 666-675

COUNTEREXAMPLES are:

%K EaL86
%A D. L. Eager
%A E. D. Lazowska
%A J. Zahorjan
%T Adaptive Load Sharing in Homogeneous Distributed Systems
%J Trans. on Software Engineering
%I IEEE
%V SE-12
%P 662-675
%D May 1986

%K SaG88
%T Midgard: A Genetic Approach to Adaptive Load Balancing for Distributed Systems
%A A.V. Sannier\0II
%A E.D. Goodman
%J Machine Learning
%D 1988
%I Kluwer Academic Pub.
%C Boston, MA
%P 174-180

-- 
Pankaj Mehra
________________________________________________________________________
Phone: (217)244-7176    FAX: (217)244-7175      E-mail: p-mehra@uiuc.edu
From: imudom@usc.edu (Sukumal Imudom)
Newsgroups: comp.os.research
Subject: Looking for info about Gopher and worldwide web
Date: 11 Nov 92 16:17:15 GMT
Article-I.D.: darkstar.1drbmcINN21u
Organization: University of Southern California, Los Angeles, CA
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp



I am looking for information on Gopher and worldwide web. Any pointers will be
aprreciated. (which groups discuss about them, etc)

Thank you,
S. Imudom
From: dcp79807@csie.nctu.edu.tw ()
Newsgroups: comp.os.research
Subject: Trace generator wanted (Uniprocessor or MP)!!
Date: 10 Nov 1992 19:56:16 GMT
Organization: Computer Science & Information Engin., Chiao-Tung U, Taiwan, ROC
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp



Dear Netter:

	Is there any package can generate trace (execution or reference)
in any means? Can I find some in public domain?  Thanks for your help.
I will post a summary when I get enough response!

Miller
--
------------------------------------------------------------------------------
Chih(4)-Zong(2) Lin(2)				| e-mail address:            
Dept. Computer Science & Information Engineering|   dcp79807@csie.nctu.edu.tw 
National Chiao-Tung University			| 
Hsinchu, Taiwan, Republic of China		|
------------------------------------------------------------------------------
From: vassil@mary-ann.cs.wisc.edu (Vassil Peytchev)
Newsgroups: comp.os.research
Subject: Info about log-structured file systems
Date: 9 Nov 1992 21:39:50 GMT
Organization: U of Wisconsin Madison - Computer Sciences
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp


I am looking for information on log-structured file systems, especially
concerning simulation and performance evaluation. Any pointers will be
aprreciated. 

Thanks in advance!

-Vassil

Note: I already have "Beating the I/O Bottleneck: A Case for Log-Structured
File Systems" by J. Ousterhout and F. Douglis, and "The Design and
Implementation of a Log-Structured File System" by M. Rosenblum amd J.
Ousterhout. 

---
 Vassil Peytchev     | Snail-mail:                 | Home:
 E-mail:             |  Dept. of Computer Sciences |  643 E.Johnson St. #8
   vassil@cs.wisc.edu|  1210 W. Dayton St.         |  Madison. WI 53703
From: MICHAEL.WILLETT@OFFICE.WANG.COM ("Michael Willett")
Newsgroups: comp.os.research
Subject: Re: Raid 7 versus earlier Raid 4 - Embedded OS performance
Date: 14 Nov 1992 02:51:40 GMT
Organization: Mail to News Gateway at Wang Labs
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp

Regarding that article analyzing Raid 7 performance (embedded OS)
versus the earlier Raid 4 that was suggested on these newsgroups,
I called up Storage Computer today and talked to their senior
Raid guru, John O'Brien.  (The others are at the Storage Computer
booth at the computer show in Boston this week.)  He
indicated that they will be posting it in the next few
days.  He said that those people who have been waiting for
the information and need it right away can call him on the
phone to get it.  His telephone number is 603-889-1961.

Michael.Willett@OFFICE.Wang.com
From: pusateri@cs.duke.edu (Thomas Pusateri)
Newsgroups: comp.os.research
Subject: cmos ?
Date: 14 Nov 1992 02:51:24 GMT
Organization: Duke University Computer Science Dept.; Durham, N.C.
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp


Anyone ever hear of an OS called cmos? This may be spelled wrong.  I
understand it was developed at either stanford or mit. At one time I
heard it was freely available. Also Mitre did some work with as well.
Thanks for any info.

Tom Pusateri
pusateri@cs.duke.edu
From: xander@paramount.nikhefk.nikhef.nl (Xander Evers)
Newsgroups: comp.os.research
Subject: Re: Difference between DYNAMIC and ADAPTIVE load balancing???
Date: 5 Nov 1992 16:30:27 GMT
Organization: NIKHEFK
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp

news@paleolithic.Colorado.EDU (The Daily Planet) writes:


>Hi there.  Subject says it all.  I have seen many papers about dynamic and
>adaptive load balancing, but I couldn't understand the difference.
>Are these really two different categories in load balancing, or are these
>two words used interchangeably in the literature.  Please post your
>response, so that other people can post their views about the responses.

The terms dynamic scheduling and adaptive scheduling are sometimes used 
in the literature in an inconsistent manner. A dynamic schedular takes 
into account the current state of affairs as it perceives it in the system.
This is done during the normal operation of the system under a dynamic and
unpredictable load.

An adaptive solution to the load balancing problem is one in which the 
algorithms and parameters used to implement the scheduling policy change 
dynamically according to the previous and current behavior of the system,
in response to previous decisions made by the scheduling system. In contrast
to an adaptive scheduler, a non-adaptive scheduler would be one which does
not necessarily modify its basic control mechanism on the basis of the
history of system activity.

In an adaptive system, the scheduling policy itself reflects changes in 
its environment--the running system. Whereas a dynamic solution takes 
environmental inputs into account when making decisions, an adaptive 
solution takes environmental stimuli into account to modify the scheduling 
policy itself. It is easy to see that it is impossible to have a static
adaptive scheduler, there are only dynamic adaptive load balancing algorithms.

Greetings,

Xander Evers
National Institute for Nuclear Physics and High-Energy Physics
P.O. Box 41882, 1009 DB Amsterdam, The Netherlands
From: andy@comp.vuw.ac.nz (Andy Bond)
Newsgroups: comp.os.research
Subject: Re: Difference between DYNAMIC and ADAPTIVE load balancing???
Date: 5 Nov 1992 23:47:38 GMT
Organization: Distributed Systems Group, Comp Sci, Victoria University of Wellington
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp

In article <1dbi73INNm41@darkstar.UCSC.EDU> xander@paramount.nikhefk.nikhef.nl (Xander Evers) writes:
>
>The terms dynamic scheduling and adaptive scheduling are sometimes used 
>in the literature in an inconsistent manner. A dynamic schedular takes 
>into account the current state of affairs as it perceives it in the system.

Eager et al. (IEEE TOSE May 1986) refer to adaptive load sharing as
reacting to changes in the system state while others have referred to
the same type of load sharing as dynamic.  I share the view of other
responders to this article that adaptive algorithms are more than just
dynamically adjusting to changes in system state.  I view adaptive
algorithms as adding an extra dimension to dynamic algorithms by
modifying the allocation algorithm and not just the parameters to the
algorithm.  In my work an adaptive allocator constructs unique
allocation algorithms for task clusters.  As resource requirements of
the task cluster change the algorithm adapts to the new cluster
profile.

andy
From: ruffin@zorglub.inria.fr (Michel Ruffin)
Newsgroups: comp.os.research
Subject: Looking for information on the use of logging
Date: 14 Nov 1992 02:51:30 GMT
Organization: INRIA, Le Chesnay - France
NNTP-Posting-Host: ftp.cse.ucsc.edu
Originator: osr@ftp


I am looking for information on the various uses of logging

I already know about the folowing uses:

transactions : Camelot, Quicksilver, Coda RVM, ...
process level recovery : Isis (and other works)
atomicity of file operations: Cedar, Decorum
mantaining consistency of copies : Echo, Harp, HA-NFS
Data reconciliation: Coda, Locus, Ficus
Speed of FS writes: Sprite LFS, Clio
debugging, monitoring: Instant Replay, Bugnet, Radar, ...
optimization of compilers (I have no reference)


More various uses ? Have you any references ?

Michel




Newsgroups: comp.os.os9
From: ferguson@x102a.harris-atd.com (ferguson ct 71078)
Subject: Re: Information on OSK
Date: Sat, 7 Nov 1992 06:02:10 GMT
Reply-To: ferguson@x102a.ess.harris.com (ferguson ct 71078)    
Organization: Harris Corporation GSS, Melbourne, Florida

In article <1992Nov5.204909.20283@newshub.sdsu.edu> butler@saturn.sdsu.edu (Michael Butler) writes:
>In the latest FAQ of OSk that was published, this was said about
>the TOP shell 'sh':
>
>........     It supports aliasing, command-line editing, history,
>environment variable replacement, shell scripting, the `command`
>operator   .............
>
>I am trying to use it right now, and am able to get the aliasing and
>history functions to work.  I do not know how to use the command-line
>editing though.  Any hints ??
>
>Thanks,
>
>Mike Butler
>butler@saturn.sdsu.edu
>


I tinkered with the bourne shell for a while (and gave up) and the
following is from memory.  First of all, the command line editing did
not work completely unless 'sh' was the login shell.  When executed as
a subshell to a 'shell' parent, only a few of the command line editing
commands worked.  Command history did not work at all unless 'sh' was
the login shell.

The command line editing key bindings are borrowed from emacs.  ^A
moves the cursor to the beginning of the line being edited.  ^E to the
end of the line.  ^D deletes the character under the cursor.  <RUBOUT>
deletes the character preceding the cursor.  There may be others, but
these are the most commonly used.  
Chuck Ferguson             Harris Government Information Systems Division
(407) 984-6010             MS: W1/7742  PO Box 98000  Melbourne, FL 32902
Internet:                  ferguson@x102c.ess.harris.com
Usenet:                    uunet!x102a!x102c!ferguson
From: s_grunwa@irau35.ira.uka.de (Knut Grunwald)
Newsgroups: comp.os.os9
Subject: Re: Information on OSK
Date: 12 Nov 1992 12:49:02 GMT
Organization: University of Karlsruhe, FRG
Distribution: uka
NNTP-Posting-Host: irau35.ira.uka.de

If you use the "sh" be aware of the termcap. The Termcap
is needed for some editing functions.

I would like to hear something about OSK packages for the
Atari TT. Is there a good port available ? Since i have an
19'' Monitor only, i can't use medium/low/st-high/vga resolution.

I would like to hear any price, but i cannot afford more than
$1000. Higher offers will be transferred to my company, which
thinks about buying a few TT's for support tasks, since
the VME-machines are just more expensive. The machines will
be used for document processing, formattinng of fixed disks and
changable disks and installation of software (generating the
descriptors, copying the drivers and system stuff for the
customer machine and installing the bought software).
This work is now done on a E6, which should be freed from
regular tasks for development.


Knut Grunwald
Newsgroups: comp.os.os9
From: bmaddox@cs.umr.edu (Brian Maddox)
Subject: More OSK info
Date: Sat, 7 Nov 1992 19:35:30 GMT
Organization: University of Missouri - Rolla
Keywords: OSK, OS9/68000, OS9/68K
Originator: bmaddox@mcs213j.cs.umr.edu

   Sorry to take up bandwidth again, but I was wondering if anyone who has gone
from OS9/6809 on a COCO to OSK would be willing to E-mail me their experiences
with OSK (specifically on the MM/1).  I would like to know of any problems that 
may exist.  Also, has anyone developed a software simulator or hardware card
that allows IBM software to be run under OSK?   Thanks.
Newsgroups: comp.os.os9
From: smann@peck.com (Steve Mann)
Subject: OS9/68K Programmer Available
Keywords: OS9 Programmer
Organization: Geoffrey G. Peck, Consultant, San Jose CA
Distribution: usa
Date: Tue, 10 Nov 1992 05:51:38 GMT


OS9/68K Programmer available for permanent position.  Qualifications
Brief in misc.jobs.resumes, or contact at smann@peck.com
From: marten@feki.toppoint.de (Marten Feldtmann)
Newsgroups: comp.os.os9
Subject: Re: Cumana ST Port? (was Re: Information on OSK)
Date: Wed, 11 Nov 92 08:38:33 GMT
Organization: Private OS/2 System

In article <kdarling.721198735@garfield.catt.ncsu.edu> kdarling@garfield.catt.ncsu.edu (Kevin Darling) writes:
>Re: Cumana port.  Here are some excerpts from a posting on other nets:
>
>"[...] The new package not only includes the professional edition of OS-9
>but also contains a word processor with mailmerge and spell-checking,
>a spreadsheet, a C compiler, a basic compiler, a screen editor and an
>assembler with debugger and linker.  A complete set of manuals weighing
>approximately 8Kg are also a part of this package.  [...]

 Hmmmm, the database "Sculptor", usually in the Cumana OS/9 port seems
not be in the package ?!

 MF


--
Marten Feldtmann,     Kieler Str. 29,       2300 Kiel 14,    Germany
E-Mail: marten@tpki.toppoint.de, FAX possible