<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://support.beocat.ksu.edu/BeocatDocs/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Dan</id>
	<title>Beocat - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://support.beocat.ksu.edu/BeocatDocs/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Dan"/>
	<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/Docs/Special:Contributions/Dan"/>
	<updated>2026-04-07T14:41:08Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.8</generator>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=919</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=919"/>
		<updated>2023-04-21T21:07:21Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* Classified, PII/HIPAA, CUI, and/or export controlled data */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Account Eligibility ==&lt;br /&gt;
Beocat resources are available to faculty and staff at K-State, Kansas higher educational institutions (subject to the KanShare MOU), and to US academic researchers that engage in collaborative research and development activities K-State researchers. Additional supporting documentation may be required prior to accessing Beocat's resources.&lt;br /&gt;
&lt;br /&gt;
Accounts are subject to annual renewal. Upon leaving K-State your account will be automatically de-activated, but you may apply for re-activation using the standard Beocat account request form.&lt;br /&gt;
&lt;br /&gt;
== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .030, as these are egregious violations.&lt;br /&gt;
&lt;br /&gt;
== Classified, PII/HIPAA, CUI, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to store and/or compute on [[wikipedia:Classified_information|Classified]], &lt;br /&gt;
[[wikipedia:Controlled Unclassified Information|CUI]],&lt;br /&gt;
[[wikipedia:Personally_identifiable_information|PII]], or [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]].&lt;br /&gt;
For this type of data we suggest the [https://www.k-state.edu/comply/cui/research-security.html K-State Research Information Security Enclave (RISE)].&lt;br /&gt;
[[wikipedia:Export_Administration_Regulations|Export controlled]] data and computation may occur on Beocat with the concurrence&lt;br /&gt;
of the appropriate KSU personnel, generally a collaboration between the researchers, Beocat staff, the Compliance Office and CISO&lt;br /&gt;
to determine appropriate safeguards are in place prior to the start of Beocat usage.&lt;br /&gt;
&lt;br /&gt;
== Access ==&lt;br /&gt;
Access to Beocat is currently prohibited from certain sensitive countries/regions, including countries designated as State Sponsors of Terrorism by the US government, and the People's Republic of China. &lt;br /&gt;
Exceptions may be possible with the agreement in writing of the appropriate K-State officials,&lt;br /&gt;
including but not limited to the Chief Compliance Officer and Chief Information Security Officer. &lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 1 year&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
* inactive eID&lt;br /&gt;
* lack of a K-State sponsor if you are not a K-State student or employee&lt;br /&gt;
** upon the transition from K-State student or employee to not being a K-State student or employee your account will be automatically deactivated. If you still have need of your account you will need to reapply.&lt;br /&gt;
** unfortunately, it would seem this gets triggered a week or two before the new semester if the student hasn't enrolled for the new semester yet.&lt;br /&gt;
* failed to follow up on the annual renewal process&lt;br /&gt;
&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Directory Permissions ==&lt;br /&gt;
In order for Beocat to be in alignment with State of Kansas regulations and industry norms, all users must have their /homes /bulk /scratch and /fastscratch directories locked down from other users, but can still share files and directories within their group or with individual users using group and individual [[AdvancedSlurm#File_Sharing|ACLs (Access Control Lists)]]. Beocat staff will be exempted from this policy as we need to work freely with all users and will manage our subdirectories to minimize access.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=896</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=896"/>
		<updated>2023-03-29T20:27:02Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* Access controls */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Export Controlled Data on Beocat ==&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these and relevant KSU guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and/or the Vice Provost for Research as appropriate.&lt;br /&gt;
&lt;br /&gt;
== Guidelines ==&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information. The following are typical guidelines and how Beocat addresses them.&lt;br /&gt;
&lt;br /&gt;
=== Access controls ===&lt;br /&gt;
#; Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
#: All Beocat accounts are individually assigned requiring username/passwords This is done through K-State's eID system, using their account and password policies. 2FA (e.g., Duo) is supported.&lt;br /&gt;
#&lt;br /&gt;
#; Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
#: All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall. Data center access is logged, and multiple CCTV security cameras are in use to monitor visitor activity.&lt;br /&gt;
&lt;br /&gt;
=== System management ===&lt;br /&gt;
#; Use regularly-updated malware protection software&lt;br /&gt;
#: Nesus is used for malware detection.&lt;br /&gt;
#&lt;br /&gt;
#; Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
#: We perform routine updates on our systems.&lt;br /&gt;
#&lt;br /&gt;
#; All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
#: All storage holding potentially sensitive information is encrypted using LUKS and/or encrypted using aes256.&lt;br /&gt;
#&lt;br /&gt;
#; Wipe electronic media in accordance with NIST 800–88 Guidelines for Media Sanitization&lt;br /&gt;
#: Electronic media is disposed of following K-State's policies on [https://www.k-state.edu/policies/ppm/3400/3436.html Media Sanitization and Disposal]&lt;br /&gt;
&lt;br /&gt;
=== Transmission of Data ===&lt;br /&gt;
#; Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
#: All access to Beocat is encrypted.&lt;br /&gt;
#&lt;br /&gt;
#; Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
#: We monitor inbound and outbound traffic. Unauthorized ingress and egress is controlled via firewalls.&lt;br /&gt;
#&lt;br /&gt;
#; Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
#: We use firewalls to prevent exfiltration, and perform monitoring of logs from an Elastic Stack instance for intrusion detection and prevention. We run a Nessus agent on many user facing systems.&lt;br /&gt;
#&lt;br /&gt;
#; Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
#: Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
=== Shared Systems ===&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
#; The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
#: All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions. Any exceptions require prior written approval by the appropriate authorities.&lt;br /&gt;
#&lt;br /&gt;
#; The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
#: All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
#&lt;br /&gt;
#; Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
#: Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=893</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=893"/>
		<updated>2023-01-19T17:01:20Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* Guidelines */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Export Controlled Data on Beocat ==&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these and relevant KSU guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and/or the Vice Provost for Research as appropriate.&lt;br /&gt;
&lt;br /&gt;
== Guidelines ==&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information. The following are typical guidelines and how Beocat addresses them.&lt;br /&gt;
&lt;br /&gt;
=== Access controls ===&lt;br /&gt;
#; Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
#: All Beocat accounts are individually assigned requiring username/passwords This is done through K-State's eID system, using their account and password policies. 2FA (e.g., Duo) is supported.&lt;br /&gt;
#&lt;br /&gt;
#; Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
#: All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall.&lt;br /&gt;
&lt;br /&gt;
=== System management ===&lt;br /&gt;
#; Use regularly-updated malware protection software&lt;br /&gt;
#: Nesus is used for malware detection.&lt;br /&gt;
#&lt;br /&gt;
#; Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
#: We perform routine updates on our systems.&lt;br /&gt;
#&lt;br /&gt;
#; All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
#: All storage holding potentially sensitive information is encrypted using LUKS and/or encrypted using aes256.&lt;br /&gt;
#&lt;br /&gt;
#; Wipe electronic media in accordance with NIST 800–88 Guidelines for Media Sanitization&lt;br /&gt;
#: Electronic media is disposed of following K-State's policies on [https://www.k-state.edu/policies/ppm/3400/3436.html Media Sanitization and Disposal]&lt;br /&gt;
&lt;br /&gt;
=== Transmission of Data ===&lt;br /&gt;
#; Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
#: All access to Beocat is encrypted.&lt;br /&gt;
#&lt;br /&gt;
#; Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
#: We monitor inbound and outbound traffic. Unauthorized ingress and egress is controlled via firewalls.&lt;br /&gt;
#&lt;br /&gt;
#; Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
#: We use firewalls to prevent exfiltration, and perform monitoring of logs from an Elastic Stack instance for intrusion detection and prevention. We run a Nessus agent on many user facing systems.&lt;br /&gt;
#&lt;br /&gt;
#; Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
#: Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
=== Shared Systems ===&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
#; The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
#: All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions. Any exceptions require prior written approval by the appropriate authorities.&lt;br /&gt;
#&lt;br /&gt;
#; The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
#: All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
#&lt;br /&gt;
#; Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
#: Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=892</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=892"/>
		<updated>2023-01-19T17:00:10Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* Export Controlled Data on Beocat */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Export Controlled Data on Beocat ==&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these and relevant KSU guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and/or the Vice Provost for Research as appropriate.&lt;br /&gt;
&lt;br /&gt;
== Guidelines ==&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information.&lt;br /&gt;
&lt;br /&gt;
=== Access controls ===&lt;br /&gt;
#; Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
#: All Beocat accounts are individually assigned requiring username/passwords This is done through K-State's eID system, using their account and password policies. 2FA (e.g., Duo) is supported.&lt;br /&gt;
#&lt;br /&gt;
#; Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
#: All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall.&lt;br /&gt;
&lt;br /&gt;
=== System management ===&lt;br /&gt;
#; Use regularly-updated malware protection software&lt;br /&gt;
#: Nesus is used for malware detection.&lt;br /&gt;
#&lt;br /&gt;
#; Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
#: We perform routine updates on our systems.&lt;br /&gt;
#&lt;br /&gt;
#; All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
#: All storage holding potentially sensitive information is encrypted using LUKS and/or encrypted using aes256.&lt;br /&gt;
#&lt;br /&gt;
#; Wipe electronic media in accordance with NIST 800–88 Guidelines for Media Sanitization&lt;br /&gt;
#: Electronic media is disposed of following K-State's policies on [https://www.k-state.edu/policies/ppm/3400/3436.html Media Sanitization and Disposal]&lt;br /&gt;
&lt;br /&gt;
=== Transmission of Data ===&lt;br /&gt;
#; Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
#: All access to Beocat is encrypted.&lt;br /&gt;
#&lt;br /&gt;
#; Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
#: We monitor inbound and outbound traffic. Unauthorized ingress and egress is controlled via firewalls.&lt;br /&gt;
#&lt;br /&gt;
#; Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
#: We use firewalls to prevent exfiltration, and perform monitoring of logs from an Elastic Stack instance for intrusion detection and prevention. We run a Nessus agent on many user facing systems.&lt;br /&gt;
#&lt;br /&gt;
#; Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
#: Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
=== Shared Systems ===&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
#; The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
#: All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions. Any exceptions require prior written approval by the appropriate authorities.&lt;br /&gt;
#&lt;br /&gt;
#; The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
#: All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
#&lt;br /&gt;
#; Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
#: Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=891</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=891"/>
		<updated>2023-01-19T16:59:13Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* Access controls */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Export Controlled Data on Beocat ==&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these and relevant KSU guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and the Vice Provost for Research.&lt;br /&gt;
&lt;br /&gt;
== Guidelines ==&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information.&lt;br /&gt;
&lt;br /&gt;
=== Access controls ===&lt;br /&gt;
#; Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
#: All Beocat accounts are individually assigned requiring username/passwords This is done through K-State's eID system, using their account and password policies. 2FA (e.g., Duo) is supported.&lt;br /&gt;
#&lt;br /&gt;
#; Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
#: All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall.&lt;br /&gt;
&lt;br /&gt;
=== System management ===&lt;br /&gt;
#; Use regularly-updated malware protection software&lt;br /&gt;
#: Nesus is used for malware detection.&lt;br /&gt;
#&lt;br /&gt;
#; Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
#: We perform routine updates on our systems.&lt;br /&gt;
#&lt;br /&gt;
#; All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
#: All storage holding potentially sensitive information is encrypted using LUKS and/or encrypted using aes256.&lt;br /&gt;
#&lt;br /&gt;
#; Wipe electronic media in accordance with NIST 800–88 Guidelines for Media Sanitization&lt;br /&gt;
#: Electronic media is disposed of following K-State's policies on [https://www.k-state.edu/policies/ppm/3400/3436.html Media Sanitization and Disposal]&lt;br /&gt;
&lt;br /&gt;
=== Transmission of Data ===&lt;br /&gt;
#; Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
#: All access to Beocat is encrypted.&lt;br /&gt;
#&lt;br /&gt;
#; Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
#: We monitor inbound and outbound traffic. Unauthorized ingress and egress is controlled via firewalls.&lt;br /&gt;
#&lt;br /&gt;
#; Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
#: We use firewalls to prevent exfiltration, and perform monitoring of logs from an Elastic Stack instance for intrusion detection and prevention. We run a Nessus agent on many user facing systems.&lt;br /&gt;
#&lt;br /&gt;
#; Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
#: Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
=== Shared Systems ===&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
#; The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
#: All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions. Any exceptions require prior written approval by the appropriate authorities.&lt;br /&gt;
#&lt;br /&gt;
#; The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
#: All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
#&lt;br /&gt;
#; Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
#: Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=799</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=799"/>
		<updated>2022-04-28T19:07:37Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* System management */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Export Controlled Data on Beocat ==&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these and relevant KSU guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and the Vice Provost for Research.&lt;br /&gt;
&lt;br /&gt;
== Guidelines ==&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information.&lt;br /&gt;
&lt;br /&gt;
=== Access controls ===&lt;br /&gt;
#; Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
#: All Beocat accounts are individually assigned requiring username/passwords This is done through K-State's eID system, using their account and password policies.&lt;br /&gt;
#&lt;br /&gt;
#; Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
#: All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall.&lt;br /&gt;
&lt;br /&gt;
=== System management ===&lt;br /&gt;
#; Use regularly-updated malware protection software&lt;br /&gt;
#: Nesus is used for malware detection.&lt;br /&gt;
#&lt;br /&gt;
#; Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
#: We perform routine updates on our systems.&lt;br /&gt;
#&lt;br /&gt;
#; All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
#: All storage holding potentially sensitive information is encrypted using LUKS and/or encrypted using aes256.&lt;br /&gt;
#&lt;br /&gt;
#; Wipe electronic media in accordance with NIST 800–88 Guidelines for Media Sanitization&lt;br /&gt;
#: Electronic media is disposed of following K-State's policies on [https://www.k-state.edu/policies/ppm/3400/3436.html Media Sanitization and Disposal]&lt;br /&gt;
&lt;br /&gt;
=== Transmission of Data ===&lt;br /&gt;
#; Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
#: All access to Beocat is encrypted.&lt;br /&gt;
#&lt;br /&gt;
#; Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
#: We monitor inbound and outbound traffic. Unauthorized ingress and egress is controlled via firewalls.&lt;br /&gt;
#&lt;br /&gt;
#; Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
#: We use firewalls to prevent exfiltration, and perform monitoring of logs from an Elastic Stack instance for intrusion detection and prevention. We run a Nessus agent on many user facing systems.&lt;br /&gt;
#&lt;br /&gt;
#; Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
#: Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
=== Shared Systems ===&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
#; The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
#: All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions. Any exceptions require prior written approval by the appropriate authorities.&lt;br /&gt;
#&lt;br /&gt;
#; The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
#: All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
#&lt;br /&gt;
#; Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
#: Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=798</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=798"/>
		<updated>2022-04-28T19:06:38Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* System management */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Export Controlled Data on Beocat ==&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these and relevant KSU guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and the Vice Provost for Research.&lt;br /&gt;
&lt;br /&gt;
== Guidelines ==&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information.&lt;br /&gt;
&lt;br /&gt;
=== Access controls ===&lt;br /&gt;
#; Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
#: All Beocat accounts are individually assigned requiring username/passwords This is done through K-State's eID system, using their account and password policies.&lt;br /&gt;
#&lt;br /&gt;
#; Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
#: All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall.&lt;br /&gt;
&lt;br /&gt;
=== System management ===&lt;br /&gt;
#; Use regularly-updated malware protection software&lt;br /&gt;
#: What counts as malware protection software in Linux? Does this need to be on all headnodes, compute nodes, or all systems? What are the performance implications of such things?&lt;br /&gt;
#&lt;br /&gt;
#; Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
#: We perform routine updates on our systems.&lt;br /&gt;
#&lt;br /&gt;
#; All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
#: All storage holding potentially sensitive information is encrypted using LUKS and/or encrypted using aes256.&lt;br /&gt;
#&lt;br /&gt;
#; Wipe electronic media in accordance with NIST 800–88 Guidelines for Media Sanitization&lt;br /&gt;
#: Electronic media is disposed of following K-State's policies on [https://www.k-state.edu/policies/ppm/3400/3436.html Media Sanitization and Disposal]&lt;br /&gt;
&lt;br /&gt;
=== Transmission of Data ===&lt;br /&gt;
#; Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
#: All access to Beocat is encrypted.&lt;br /&gt;
#&lt;br /&gt;
#; Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
#: We monitor inbound and outbound traffic. Unauthorized ingress and egress is controlled via firewalls.&lt;br /&gt;
#&lt;br /&gt;
#; Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
#: We use firewalls to prevent exfiltration, and perform monitoring of logs from an Elastic Stack instance for intrusion detection and prevention. We run a Nessus agent on many user facing systems.&lt;br /&gt;
#&lt;br /&gt;
#; Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
#: Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
=== Shared Systems ===&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
#; The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
#: All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions. Any exceptions require prior written approval by the appropriate authorities.&lt;br /&gt;
#&lt;br /&gt;
#; The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
#: All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
#&lt;br /&gt;
#; Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
#: Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=792</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=792"/>
		<updated>2022-03-30T13:23:32Z</updated>

		<summary type="html">&lt;p&gt;Dan: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Export Controlled Data on Beocat ==&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these and relevant KSU guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and the Vice Provost for Research.&lt;br /&gt;
&lt;br /&gt;
== Guidelines ==&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information.&lt;br /&gt;
&lt;br /&gt;
=== Access controls ===&lt;br /&gt;
#; Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
#: All Beocat accounts are individually assigned requiring username/passwords This is done through K-State's eID system, using their account and password policies.&lt;br /&gt;
#&lt;br /&gt;
#; Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
#: All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall.&lt;br /&gt;
&lt;br /&gt;
=== System management ===&lt;br /&gt;
#; Use regularly-updated malware protection software&lt;br /&gt;
#: What counts as malware protection software in Linux? Does this need to be on all headnodes, compute nodes, or all systems? What are the performance implications of such things?&lt;br /&gt;
#&lt;br /&gt;
#; Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
#: We perform routine updates on our systems.&lt;br /&gt;
#&lt;br /&gt;
#; All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
#: All storage holding potentially sensitive information is encrypted using LUKS and/or encrypted using aes256.&lt;br /&gt;
#&lt;br /&gt;
#; Wipe electronic media in accordance with NIST 800–88 Guidelines for Media Sanitization&lt;br /&gt;
#: electronic media is disposed of following K-State's policies on [https://www.k-state.edu/policies/ppm/3400/3436.html Media Sanitization and Disposal]&lt;br /&gt;
&lt;br /&gt;
=== Transmission of Data ===&lt;br /&gt;
#; Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
#: All access to Beocat is encrypted.&lt;br /&gt;
#&lt;br /&gt;
#; Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
#: We monitor inbound and outbound traffic. Unauthorized ingress and egress is controlled via firewalls.&lt;br /&gt;
#&lt;br /&gt;
#; Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
#: We use firewalls to prevent exfiltration, and perform monitoring of logs from an Elastic Stack instance for intrusion detection and prevention. We run a Nessus agent on many user facing systems.&lt;br /&gt;
#&lt;br /&gt;
#; Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
#: Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
=== Shared Systems ===&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
#; The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
#: All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions. Any exceptions require prior written approval by the appropriate authorities.&lt;br /&gt;
#&lt;br /&gt;
#; The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
#: All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
#&lt;br /&gt;
#; Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
#: Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=791</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=791"/>
		<updated>2022-03-30T13:22:56Z</updated>

		<summary type="html">&lt;p&gt;Dan: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=== Export Controlled Data on Beocat ===&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these and relevant KSU guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and the Vice Provost for Research.&lt;br /&gt;
&lt;br /&gt;
== Guidelines ==&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information.&lt;br /&gt;
&lt;br /&gt;
=== Access controls ===&lt;br /&gt;
#; Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
#: All Beocat accounts are individually assigned requiring username/passwords This is done through K-State's eID system, using their account and password policies.&lt;br /&gt;
#&lt;br /&gt;
#; Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
#: All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall.&lt;br /&gt;
&lt;br /&gt;
=== System management ===&lt;br /&gt;
#; Use regularly-updated malware protection software&lt;br /&gt;
#: What counts as malware protection software in Linux? Does this need to be on all headnodes, compute nodes, or all systems? What are the performance implications of such things?&lt;br /&gt;
#&lt;br /&gt;
#; Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
#: We perform routine updates on our systems.&lt;br /&gt;
#&lt;br /&gt;
#; All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
#: All storage holding potentially sensitive information is encrypted using LUKS and/or encrypted using aes256.&lt;br /&gt;
#&lt;br /&gt;
#; Wipe electronic media in accordance with NIST 800–88 Guidelines for Media Sanitization&lt;br /&gt;
#: electronic media is disposed of following K-State's policies on [https://www.k-state.edu/policies/ppm/3400/3436.html Media Sanitization and Disposal]&lt;br /&gt;
&lt;br /&gt;
=== Transmission of Data ===&lt;br /&gt;
#; Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
#: All access to Beocat is encrypted.&lt;br /&gt;
#&lt;br /&gt;
#; Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
#: We monitor inbound and outbound traffic. Unauthorized ingress and egress is controlled via firewalls.&lt;br /&gt;
#&lt;br /&gt;
#; Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
#: We use firewalls to prevent exfiltration, and perform monitoring of logs from an Elastic Stack instance for intrusion detection and prevention. We run a Nessus agent on many user facing systems.&lt;br /&gt;
#&lt;br /&gt;
#; Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
#: Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
=== Shared Systems ===&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
#; The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
#: All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions. Any exceptions require prior written approval by the appropriate authorities.&lt;br /&gt;
#&lt;br /&gt;
#; The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
#: All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
#&lt;br /&gt;
#; Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
#: Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=784</id>
		<title>ExportControl</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=ExportControl&amp;diff=784"/>
		<updated>2022-03-29T18:12:26Z</updated>

		<summary type="html">&lt;p&gt;Dan: Export Control policies and procedures for Beocat&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Export Controlled Data on Beocat&lt;br /&gt;
&lt;br /&gt;
Export-controlled information housed on Beocat must be managed in accordance with these guidelines. Export-controlled information that is received by or brought to KSU must be housed on a server designated for this purpose. Any exceptions must be explicitly approved by the Chief Information Security Officer, the Director of Export Compliance, and the Vice Provost for Research.&lt;br /&gt;
&lt;br /&gt;
Guidelines&lt;br /&gt;
Data subject to ITAR or EAR export control restrictions is referred to collectively below as Controlled Information.&lt;br /&gt;
&lt;br /&gt;
Access controls&lt;br /&gt;
    Do not post Controlled Information on public websites or websites that rely solely on IP addresses for access control. Instead, secure access using individually-assigned accounts requiring username/password, user certificates, or other user-specific authentication methods.&lt;br /&gt;
&lt;br /&gt;
- All Beocat accounts are individually assigned requiring username/passwords.&lt;br /&gt;
&lt;br /&gt;
    Protect Controlled Information by at least one physical or electronic barrier (e.g., locked container or room, login and password) when not under direct individual control.&lt;br /&gt;
&lt;br /&gt;
- All Beocat accounts are protected by a username/password. Beocat physical servers are in locked data centers in Durland Hall and Nichols Hall.&lt;br /&gt;
&lt;br /&gt;
System management&lt;br /&gt;
&lt;br /&gt;
    Use regularly-updated malware protection software&lt;br /&gt;
    Keep computers hosting Controlled Information up to date on security patches and updates.&lt;br /&gt;
    All Controlled Information must be encrypted if stored on mobile computing devices such as laptops, PDA's and removable media such as thumb drives or CD/DVD. See additional notes below.&lt;br /&gt;
    Wipe electronic media in accordance with NIST 800–88: Guidelines for Media Sanitization&lt;br /&gt;
&lt;br /&gt;
Transmission of Data&lt;br /&gt;
&lt;br /&gt;
    Do not transmit or email Controlled Information unencrypted. If encryption is not available, data must be individually encrypted using at least application-provided mechanisms such as the password-based encryption provided in Microsoft Office 2007 and above.&lt;br /&gt;
&lt;br /&gt;
- All access to Beocat is encrypted.&lt;br /&gt;
&lt;br /&gt;
    Provide monitoring and control over inbound and outbound network traffic. Block unauthorized ingress and egress.&lt;br /&gt;
&lt;br /&gt;
- Adam/Kyle?&lt;br /&gt;
&lt;br /&gt;
    Detect exfiltration of data using firewalls, router policies, intrusion prevention/detection systems, or host-based security services.&lt;br /&gt;
&lt;br /&gt;
- Adam/Kyle?&lt;br /&gt;
&lt;br /&gt;
    Transfer controlled information only to subcontractors with a need to know. Subcontractors must adhere to these same data protection requirements. Include these data protection requirements, including this requirement, in all subcontracts if access to or generation of controlled data will take place.&lt;br /&gt;
&lt;br /&gt;
- Information transfer to subcontractors is controlled by, and the responsibility of, the individual Beocat user.&lt;br /&gt;
&lt;br /&gt;
Shared Systems&lt;br /&gt;
&lt;br /&gt;
In such cases where the Controlled Information is a software executable that will be run on a shared (multi-user) system such as a compute cluster, the following additional guidelines apply:&lt;br /&gt;
&lt;br /&gt;
    The directories containing the software shall be access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others shall have no access permissions.&lt;br /&gt;
&lt;br /&gt;
- All Beocat user directories are access controlled so that only its designated user(s) as approved by the PI will have read, write and execute permissions. All others have no access permissions.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
    The shared system shall be managed solely by U.S. Persons, as defined in the export regulations. All users with root or sudo privileges must be U.S. Persons.&lt;br /&gt;
&lt;br /&gt;
- All Beocat staff and those with root/sudo privileges are U.S. Persons.&lt;br /&gt;
&lt;br /&gt;
    Only U.S. Persons shall have unescorted physical access to the shared system.&lt;br /&gt;
&lt;br /&gt;
- Visitors to the Engineering and Nichols Data Centers are required to be escorted.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=756</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=756"/>
		<updated>2022-01-18T20:49:47Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* Account Eligibility */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Account Eligibility ==&lt;br /&gt;
Beocat resources are available to faculty and staff at K-State, Kansas higher educational institutions (subject to the KanShare MOU), and to US academic researchers that engage in collaborative research and development activities K-State researchers. Additional supporting documentation may be required prior to accessing Beocat's resources.&lt;br /&gt;
&lt;br /&gt;
Accounts for those who are not students or staff at K-State are subject to annual renewal. Upon leaving K-State your account will be automatically de-activated, but you may apply for re-activation using the standard Beocat account request form.&lt;br /&gt;
&lt;br /&gt;
== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .050-2, and .050-4, as these are egregious violations.&lt;br /&gt;
&lt;br /&gt;
== Classified, PII/HIPAA, CUI, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to store and/or compute on [[wikipedia:Classified_information|Classified]], &lt;br /&gt;
[[wikipedia:Controlled Unclassified Information|CUI]],&lt;br /&gt;
[[wikipedia:Personally_identifiable_information|PII]], [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]] or [[wikipedia:Export_Administration_Regulations|export controlled]] data. &lt;br /&gt;
For this type of data we suggest the [https://www.k-state.edu/comply/cui/research-security.html K-State Research Information Security Enclave (RISE)].&lt;br /&gt;
&lt;br /&gt;
== Access ==&lt;br /&gt;
Access to Beocat is currently prohibited from certain sensitive countries/regions, including countries designated as State Sponsors of Terrorism by the US government, and the People's Republic of China. &lt;br /&gt;
Exceptions may be possible with the agreement in writing of the appropriate K-State officials,&lt;br /&gt;
including but not limited to the Chief Compliance Officer and Chief Information Security Officer. &lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 2 years&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
* inactive eID&lt;br /&gt;
* lack of a K-State sponsor if you are not a K-State student or employee&lt;br /&gt;
&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=747</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=747"/>
		<updated>2021-12-07T20:18:57Z</updated>

		<summary type="html">&lt;p&gt;Dan: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Account Eligibility ==&lt;br /&gt;
Beocat resources are available to faculty and staff at K-State, Kansas higher educational institutions (subject to the KanShare MOU), and to US academic researchers that engage in collaborative research and development activities K-State researchers. Additional supporting documentation may be required prior to accessing Beocat's resources.&lt;br /&gt;
 &lt;br /&gt;
== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .050-2, and .050-4, as these are egregious violations.&lt;br /&gt;
&lt;br /&gt;
== Classified, PII/HIPAA, CUI, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to store and/or compute on [[wikipedia:Classified_information|Classified]], &lt;br /&gt;
[[wikipedia:Controlled Unclassified Information|CUI]],&lt;br /&gt;
[[wikipedia:Personally_identifiable_information|PII]], [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]] or [[wikipedia:Export_Administration_Regulations|export controlled]] data. &lt;br /&gt;
For this type of data we suggest the [https://www.k-state.edu/comply/cui/research-security.html K-State Research Information Security Enclave (RISE)].&lt;br /&gt;
&lt;br /&gt;
== Access ==&lt;br /&gt;
Access to Beocat is currently prohibited from certain sensitive countries/regions, including countries designated as State Sponsors of Terrorism by the US government, and the People's Republic of China. &lt;br /&gt;
Exceptions may be possible with the agreement in writing of the appropriate K-State officials,&lt;br /&gt;
including but not limited to the Chief Compliance Officer and Chief Information Security Officer. &lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 2 years&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
* inactive eID&lt;br /&gt;
* lack of a K-State sponsor if you are not a K-State student or employee&lt;br /&gt;
&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=746</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=746"/>
		<updated>2021-12-07T20:18:11Z</updated>

		<summary type="html">&lt;p&gt;Dan: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Account Eligibility ==&lt;br /&gt;
Beocat resources are available to faculty and staff at K-State, Kansas higher educational institutions (subject to the KanShare MOU), and to US academic researchers that engage in collaborative research and development activities K-State researchers. Additional supporting documentation may be required prior to accessing Beocat's resources.&lt;br /&gt;
 &lt;br /&gt;
== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .050-2, and .050-4, as these are egregious violations.&lt;br /&gt;
&lt;br /&gt;
== Classified, PII/HIPAA, CUI, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to store and/or compute on [[wikipedia:Classified_information|Classified]], &lt;br /&gt;
[[wikipedia:Controlled Unclassified Information|CUI Data]],&lt;br /&gt;
[[wikipedia:Personally_identifiable_information|PII]], [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]] or [[wikipedia:Export_Administration_Regulations|export controlled]] data. &lt;br /&gt;
For this type of data we suggest the [https://www.k-state.edu/comply/cui/research-security.html K-State Research Information Security Enclave (RISE)].&lt;br /&gt;
&lt;br /&gt;
== Access ==&lt;br /&gt;
Access to Beocat is currently prohibited from certain sensitive countries/regions, including countries designated as State Sponsors of Terrorism by the US government, and the People's Republic of China. &lt;br /&gt;
Exceptions may be possible with the agreement in writing of the appropriate K-State officials,&lt;br /&gt;
including but not limited to the Chief Compliance Officer and Chief Information Security Officer. &lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 2 years&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
* inactive eID&lt;br /&gt;
* lack of a K-State sponsor if you are not a K-State student or employee&lt;br /&gt;
&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=745</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=745"/>
		<updated>2021-12-06T18:52:16Z</updated>

		<summary type="html">&lt;p&gt;Dan: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .050-2, and .050-4, as these are egregious violations.&lt;br /&gt;
== Classified, PII/HIPAA, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to store and/or compute on [[wikipedia:Classified_information|Classified]], [[wikipedia:Personally_identifiable_information|PII]], [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]] or [[wikipedia:Export_Administration_Regulations|export controlled]] data. &lt;br /&gt;
For this type of data we suggest the [https://www.k-state.edu/comply/cui/research-security.html K-State Research Information Security Enclave (RISE)].&lt;br /&gt;
&lt;br /&gt;
== CUI Data ==&lt;br /&gt;
Beocat is not currently equipped to store and/or compute on [[wikipedia:Controlled Unclassified Information|CUI Data]]. &lt;br /&gt;
For this type of data we suggest the [https://www.k-state.edu/comply/cui/research-security.html K-State Research Information Security Enclave (RISE)].&lt;br /&gt;
&lt;br /&gt;
== Access ==&lt;br /&gt;
Access to Beocat is currently prohibited from certain sensitive countries/regions, including countries designated as State Sponsors of Terrorism by the US government, and the People's Republic of China. &lt;br /&gt;
Exceptions may be possible with the agreement in writing of the appropriate K-State officials,&lt;br /&gt;
including but not limited to the Chief Compliance Officer and Chief Information Security Officer. &lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 2 years&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
* inactive eID&lt;br /&gt;
* lack of a K-State sponsor if you are not a K-State student or employee&lt;br /&gt;
&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=744</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=744"/>
		<updated>2021-12-06T18:48:47Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* Account deactivation */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .050-2, and .050-4, as these are egregious violations.&lt;br /&gt;
== Classified, PII/HIPAA, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to handle [[wikipedia:Classified_information|Classified]], [[wikipedia:Personally_identifiable_information|PII]], [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]] or [[wikipedia:Export_Administration_Regulations|export controlled]] data.&lt;br /&gt;
== CUI Data ==&lt;br /&gt;
Beocat is not currently equipped to store and/or compute on [[wikipedia:Controlled Unclassified Information|CUI Data]]. We suggest the KSU RISE environment.&lt;br /&gt;
&lt;br /&gt;
== Access ==&lt;br /&gt;
Access to Beocat is currently prohibited from certain sensitive countries/regions, including countries designated as State Sponsors of Terrorism by the US government, and the People's Republic of China. &lt;br /&gt;
Exceptions may be possible with the agreement in writing of the appropriate K-State officials,&lt;br /&gt;
including but not limited to the Chief Compliance Officer and Chief Information Security Officer. &lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 2 years&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
* inactive eID&lt;br /&gt;
* lack of a K-State sponsor if you are not a K-State student or employee&lt;br /&gt;
&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=743</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=743"/>
		<updated>2021-12-06T18:47:01Z</updated>

		<summary type="html">&lt;p&gt;Dan: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .050-2, and .050-4, as these are egregious violations.&lt;br /&gt;
== Classified, PII/HIPAA, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to handle [[wikipedia:Classified_information|Classified]], [[wikipedia:Personally_identifiable_information|PII]], [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]] or [[wikipedia:Export_Administration_Regulations|export controlled]] data.&lt;br /&gt;
== CUI Data ==&lt;br /&gt;
Beocat is not currently equipped to store and/or compute on [[wikipedia:Controlled Unclassified Information|CUI Data]]. We suggest the KSU RISE environment.&lt;br /&gt;
&lt;br /&gt;
== Access ==&lt;br /&gt;
Access to Beocat is currently prohibited from certain sensitive countries/regions, including countries designated as State Sponsors of Terrorism by the US government, and the People's Republic of China. &lt;br /&gt;
Exceptions may be possible with the agreement in writing of the appropriate K-State officials,&lt;br /&gt;
including but not limited to the Chief Compliance Officer and Chief Information Security Officer. &lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 2 years&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
* inactive eID&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=742</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=742"/>
		<updated>2021-12-06T18:40:14Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* Account deactivation */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .050-2, and .050-4, as these are egregious violations.&lt;br /&gt;
== Classified, PII/HIPAA, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to handle [[wikipedia:Classified_information|Classified]], [[wikipedia:Personally_identifiable_information|PII]], [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]] or [[wikipedia:Export_Administration_Regulations|export controlled]] data.&lt;br /&gt;
== CUI Data ==&lt;br /&gt;
Beocat is not currently equipped to store and/or compute on [[wikipedia:Controlled Unclassified Information|CUI Data]]. We suggest the KSU RISE environment.&lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 2 years&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
* inactive eID&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Main_Page&amp;diff=739</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Main_Page&amp;diff=739"/>
		<updated>2021-10-22T14:16:40Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* How do I get priority access */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== What is Beocat? ==&lt;br /&gt;
Beocat is the [[wikipedia:High-performance_computing|High-Performance Computing (HPC)]] cluster at [http://www.ksu.edu Kansas State University]. It is run by the Institute for Computational Research in Engineering and Science, which is a function of the [http://www.cs.ksu.edu/ Computer Science] department. Beocat is available to any educational researcher in the state of Kansas (and his or her collaborators) without cost. Priority access is given to those researchers who have contributed resources.&lt;br /&gt;
&lt;br /&gt;
Beocat is actually comprised of several different cluster computing systems&lt;br /&gt;
* &amp;quot;Beocat&amp;quot;, as used by most people is a [[wikipedia:Beowulf cluster|Beowulf cluster]] of CentOS Linux servers coordinated by the [https://slurm.schedmd.com/ Slurm] job submission and scheduling system. Our [[Compute Nodes]] (hardware) and [[installed software]] have separate pages on this wiki. The current status of this cluster can be monitored by visiting [http://ganglia.beocat.ksu.edu/ http://ganglia.beocat.ksu.edu/].&lt;br /&gt;
* A small [[wikipedia:Openstack|Openstack]] cloud-computing infrastructure&lt;br /&gt;
&lt;br /&gt;
== How Do I Use Beocat? ==&lt;br /&gt;
First, you need to get an account by visiting [https://account.beocat.ksu.edu/ https://account.beocat.ksu.edu/] and filling out the form. In most cases approval for the account will be granted in less than one business day, and sometimes much sooner. When your account has been approved, you will be added to our [[LISTSERV]], where we announce any changes, maintenance periods, or other issues.&lt;br /&gt;
&lt;br /&gt;
Once you have an account, you can access Beocat via SSH and can transfer files in or out via SCP or SFTP (or [https://www.globus.org/ Globus Connect] using the endpoint ''beocat#beocat''). If you don't know what those are, please see our [[LinuxBasics]] page. If you are familiar with these, connect your client to headnode.beocat.ksu.edu and use your K-State eID credentials to login.&lt;br /&gt;
&lt;br /&gt;
As mentioned above, we use Slurm for job submission and scheduling. If you've never worked with a batch-queueing system before, submitting a job is different than running on a standalone Linux machine. Please see our [[SlurmBasics]] page for an introduction on how to submit your first job. If you are already familiar with Slurm, we also have an [[AdvancedSlurm]] page where we can adjust the fine-tuning. If you're new to HPC, we highly recommend the [http://www.oscer.ou.edu/education.php Supercomputing in Plain English (SiPE)] series by OU. In particular, the older course's streaming videos are an excellent resource, even if you do not complete the exercises.&lt;br /&gt;
&lt;br /&gt;
==== Get an account at  [https://account.beocat.ksu.edu/ https://account.beocat.ksu.edu/] ====&lt;br /&gt;
==== Read about  [[Installed software]] and languages ====&lt;br /&gt;
==== Learn about Slurm at [[SlurmBasics]] and [[AdvancedSlurm]] ====&lt;br /&gt;
==== Run Interactive Jobs! [[OpenOnDemand]] ====&lt;br /&gt;
&lt;br /&gt;
==== Big Data course on Beocat! [[BigDataOnBeocat]] ====&lt;br /&gt;
&lt;br /&gt;
== Running Software on Beocat ==&lt;br /&gt;
Running software on Beocat involves submitting a small job script to the scheduler which will use the information in that job script to allocate the resources your job needs then start the code running.  Click on the links below to see examples of how to run applications written in some common languages used on high-performance computers.  The first link for OpenMPI also provides general information on loading modules and using &amp;lt;B&amp;gt;sbatch&amp;lt;/B&amp;gt; and &amp;lt;B&amp;gt;scancel&amp;lt;/B&amp;gt; to submit and cancel jobs.&lt;br /&gt;
* Running an [[Installed software#OpenMPI|MPI job]]&lt;br /&gt;
* Running an [[Installed software#R|R job]]&lt;br /&gt;
* Running a [[Installed software#Python|Python job]]&lt;br /&gt;
* Running a [[Installed software#MatLab compiler|Matlab job]]&lt;br /&gt;
* Running [[RSICC|RSICC codes]]&lt;br /&gt;
&lt;br /&gt;
== Writing and Installing Software on Beocat ==&lt;br /&gt;
* If you are writing software for Beocat and it is in an installed scripting language like R, Perl, or Python, please look at our [[Installed software]] page to see what we have available and any usage guidelines we have posted there.&lt;br /&gt;
* If you need to write compiled code such as Fortran, C, or C++, we offer both GNU and Intel compilers. See our [[FAQ]] for more details.&lt;br /&gt;
* In either case, we suggest you head to our [[Tips and Tricks]] page for helpful hints.&lt;br /&gt;
* If you wish to install software in your home directory, we have a [[Training Videos#Installing_files_in_your_Home_Directory|video]] showing how to do this.&lt;br /&gt;
&lt;br /&gt;
==  How do I get help? ==&lt;br /&gt;
You're in our support Wiki now, and that's a great place to start! We highly suggest that before you send us email, you visit our [[FAQ]]. If you're just getting started our [[Training Videos]] might be useful to you.&lt;br /&gt;
&lt;br /&gt;
If your answer isn't there, you can email us at [mailto:beocat@cs.ksu.edu beocat@cs.ksu.edu]. ''Please'' send all email to this address and not to any of our staff directly. This will ensure your support request gets entered into our tracker, and will get your questions answered as quickly as possible. Please keep the subject line as descriptive as possible and include any pertinent details to your problem (i.e. job ids, commands run, working directory, program versions,.. etc). If the problem is occurring on a headnode, please be sure to include the name of the headnode. This can be found by running the &amp;lt;tt&amp;gt;hostname&amp;lt;/tt&amp;gt; command.&lt;br /&gt;
&lt;br /&gt;
We are also available on IRC on the [https://libera.chat/guides/connect Libera chat servers] in the channel #beocat. This is useful ''especially'' if you have a quick question, as you'd be surprised the times when at least one of us is around. If you do have a question be sure to mention '''m0zes''' and/or '''kylehutson''' in your message, and it should grab our attention. [https://kiwiirc.com/nextclient/irc.libera.chat/#beocat Available from a web browser here.]&lt;br /&gt;
&lt;br /&gt;
For interactive assistance, we offer a weekly open support session as mentioned in our calendar down below. Alternatively, we can often schedule a time to meet with you individually. You just need to send us an e-mail and provide us with the details we asked for above.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;H4&amp;gt;&lt;br /&gt;
Again, when you email us at [mailto:beocat@cs.ksu.edu beocat@cs.ksu.edu] please give us the job ID number, the path and script name for the job, and a full description of the problem.  It may also be useful to include the output to 'module list'.&lt;br /&gt;
&amp;lt;/H4&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Twitter ==&lt;br /&gt;
We now have [https://twitter.com/KSUBeocat Twitter]. Follow us to find out the latest from Beocat, or tweet to us to find answers to quick questions. This won't replace the mailing list for major announcements, but will be used for more minor notices.&lt;br /&gt;
{{#widget:Twitter timeline|id=KSUBeocat|count=6}}&lt;br /&gt;
&lt;br /&gt;
== How do I get priority access ==&lt;br /&gt;
We're glad you asked! Contact [mailto:dan@ksu.edu Dr. Dan Andresen] to find out how contributions to Beocat will prioritize your access to Beocat. In general, users contribute nodes to Beocat (aka the &amp;quot;Condo&amp;quot; model), to which their research group has priority access, in addition to elevated general priority for the rest of Beocat. If jobs from other researchers are occupying the node, Slurm will automatically halt and reschedule those jobs immediately to allow contributor access. Unused CPU time on the node is available for other Beocat users.&lt;br /&gt;
&lt;br /&gt;
== External Computing Resources ==&lt;br /&gt;
&lt;br /&gt;
We have access to supercomputing resources at other sites in the country through&lt;br /&gt;
the XSEDE (eXtreme Science and Engineering Discovery Environment) portal.&lt;br /&gt;
We have a large allocation of core-hours that can be used for testing and running&lt;br /&gt;
software, plus each user can apply for their own allocation if needed.&lt;br /&gt;
These resources can allow users to run jobs if they are not able to get enough&lt;br /&gt;
access on Beocat, but they are especially useful for when we don't have the needed&lt;br /&gt;
resources on Beocat like access to 4 TB nodes on Bridges2, or more 64-bit&lt;br /&gt;
GPUs, or Matlab licenses.  Click [[XSEDE|here]] to see what resources &lt;br /&gt;
we have access to and to get access to some directions on how to use them.&lt;br /&gt;
Then contact [mailto:dan@ksu.edu Dr. Dan Andresen] to find out how to access our XSEDE resources.&lt;br /&gt;
&lt;br /&gt;
We also have free unlimited access to the Open Science Grid.&lt;br /&gt;
This is a high-throughput computing environment designed to efficiently&lt;br /&gt;
run lots of small jobs by spreading them across supercomputing systems in the&lt;br /&gt;
U.S. and Europe to use spare compute cycles donated to this project.  Beocat is&lt;br /&gt;
one of those systems that runs outside OSG jobs when our users are not fully&lt;br /&gt;
utilizing all our compute nodes.  For more information on how to get an OSG&lt;br /&gt;
account and take advantage of this resource, click [[OSG|here]].&lt;br /&gt;
For help in getting access to OSG, email [mailto:daveturner@ksu.edu Dr. Dave Turner].&lt;br /&gt;
&lt;br /&gt;
== Policies ==&lt;br /&gt;
You can find our policies [[Policy|here]]&lt;br /&gt;
&lt;br /&gt;
== Credits and Accolades ==&lt;br /&gt;
See the published credits and other accolades received by Beocat [[Credits|here]]&lt;br /&gt;
&lt;br /&gt;
== Upcoming Events ==&lt;br /&gt;
{{#widget:Google Calendar &lt;br /&gt;
|id=hek6gpeu4bg40tdb2eqdrlfiuo@group.calendar.google.com &lt;br /&gt;
|color=711616 &lt;br /&gt;
|view=AGENDA &lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=738</id>
		<title>Policy</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=Policy&amp;diff=738"/>
		<updated>2021-10-22T14:09:55Z</updated>

		<summary type="html">&lt;p&gt;Dan: /* CUI Data */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== K-State Information Technology Usage Policy ==&lt;br /&gt;
As Beocat is a K-State resource, the following usage policy also applies: http://www.k-state.edu/policies/ppm/3420.html&lt;br /&gt;
&lt;br /&gt;
Please pay close attention to .050-2, and .050-4, as these are egregious violations.&lt;br /&gt;
== Classified, PII/HIPAA, and/or export controlled data ==&lt;br /&gt;
Beocat is not equipped to handle [[wikipedia:Classified_information|Classified]], [[wikipedia:Personally_identifiable_information|PII]], [[wikipedia:Health_Insurance_Portability_and_Accountability_Act|HIPAA]] or [[wikipedia:Export_Administration_Regulations|export controlled]] data.&lt;br /&gt;
== CUI Data ==&lt;br /&gt;
Beocat is not currently equipped to store and/or compute on [[wikipedia:Controlled Unclassified Information|CUI Data]]. We suggest the KSU RISE environment.&lt;br /&gt;
&lt;br /&gt;
== Maintenance ==&lt;br /&gt;
Beocat reserves the right to a 24 hour maintenance period every other week. However, this maintenance is not always necessary. Maintenance intentions and reservations will always be announced on the mailing list 2 weeks before an actual maintenance period is in effect.&lt;br /&gt;
&lt;br /&gt;
== Head node computational tasks ==&lt;br /&gt;
The head node serves as a shell server and development environment for Beocat users. We wish to keep this machine running responsively to make work easier. We do not have a problem with running simple post-processing work on the head node directly. But, if your process seems too computation or memory intensive, it may have its priority severely reduced or may be killed completely. If in doubt, ask.&lt;br /&gt;
&lt;br /&gt;
Due to abuses of the head node, there are now strict limits in place. If a process uses more than 4GB of RSS memory or 6GB of virtual memory, it will get killed automatically. RSS Memory is limited to 12GB across all users. CPU Usage is allocated with a fair-share algorithm, all users have equivalent access to CPU time.&lt;br /&gt;
== Backups ==&lt;br /&gt;
For those of you using our hosted virtual machines, no backups of said machines or data are made.&lt;br /&gt;
&lt;br /&gt;
At this point in time, due to the size of our main storage, we are unable to provide backups of any data.&lt;br /&gt;
&lt;br /&gt;
== Home Directory Quota ==&lt;br /&gt;
Each home directory has a quota of 1TB. If you use more that 1TB in your home directory, we will notify you and provide a window for resolving the issue. If no action is underwent, we will move data elsewhere.&lt;br /&gt;
&lt;br /&gt;
== Bulk Usage ==&lt;br /&gt;
We have no quota for usage within our /bulk filesystem, but data stored here must be paid for at a rate of $45/TB/year, billed monthly.&lt;br /&gt;
&lt;br /&gt;
== Account deactivation ==&lt;br /&gt;
If your account meets any of the following criteria:&lt;br /&gt;
* inactive for 2 years&lt;br /&gt;
* invalid e-mail address on file&lt;br /&gt;
* unsubscribed from our mailing list&lt;br /&gt;
we will mark the account for archival, and remove your ability to login. If you should need the account again, please fill out our [https://account.beocat.ksu.edu/user account request form.]&lt;br /&gt;
&lt;br /&gt;
== Administrative access to home, bulk and scratch directories ==&lt;br /&gt;
Beocat support staff have the need, from time to time, to access information contained within the directories of other users, for support purposes. To that end, there is an access control list that gives them read access to user home, bulk, and scratch directories.&lt;br /&gt;
&lt;br /&gt;
== Acknowledging Use of Beocat Resources and/or Personnel in Publications ==&lt;br /&gt;
Click [[PapersAndGrants|here]] for a list of publications that used Beocat resources and/or personnel.&lt;br /&gt;
&lt;br /&gt;
# A publication that is based in whole or in part on computations performed using Beocat systems, including but not limited to hardware, storage, networking and/or software, should incorporate the following text into the Acknowledgements section of the publication:&lt;br /&gt;
#* [Some of] The computing for this project was performed on the Beocat Research Cluster at Kansas State University, which is funded in part by NSF grants CNS-1006860, EPS-1006860, EPS-0919443, ACI-1440548, CHE-1726332, and NIH P20GM113109.&lt;br /&gt;
# If any Beocat staff member(s) assisted with the work in any way, then for each Beocat staff member that was involved in the work:&lt;br /&gt;
## If the publication includes a substantial amount of text about the work that the Beocat staff member contributed to, and if the Beocat staff member did a substantial amount of development or optimization of software, and/or they contributed significantly to the writing of the publication, then that staff member should be included as a co-author on that publication, with author order to be negotiated among the authors. &lt;br /&gt;
##; NOTE : This requirement can be waived for tenure track (but not yet tenured) faculty if the faculty member has a compelling tenure-related interest in, for example, producing single-author publications.&lt;br /&gt;
## If the conditions above don't apply, then the Beocat staff member should be acknowledged by name and job title in the Acknowledgements section of the paper. &lt;br /&gt;
##; For example : Beocat Director Daniel Andresen and Beocat Systems Administrator Adam Tygart provided valuable technical expertise. &lt;br /&gt;
# A citation for your publication should be added to our [[PapersAndGrants|papers and grants page]].&lt;br /&gt;
&lt;br /&gt;
== IRB Statement ==&lt;br /&gt;
=== INFORMATION ===&lt;br /&gt;
If you are a Beocat user, whenever you submit a job, delete a job, or otherwise interact with the&lt;br /&gt;
scheduler, automatic information about this is logged and will be used in this study. This will include&lt;br /&gt;
information about the job including requested resources (memory, processors, duration, modules, etc.).&lt;br /&gt;
We may send you a followup request for more information if, for example, you delete a job. Your&lt;br /&gt;
participation is optional.&lt;br /&gt;
=== RISKS ===&lt;br /&gt;
There are no anticipated risks with participation in this study other than the time responding to a&lt;br /&gt;
followup information request.&lt;br /&gt;
=== BENEFITS ===&lt;br /&gt;
Your participation in our studies will help us learn how to optimize the performance of Beocat and other&lt;br /&gt;
HPC resources, which will help our users and our overall science and education efforts.&lt;br /&gt;
=== CONFIDENTIALITY ===&lt;br /&gt;
All information gathered in this study will be kept confidential. All information about your jobs will not&lt;br /&gt;
use real names or eIDs, and any publications will aggregate overall information.&lt;br /&gt;
=== CONTACT ===&lt;br /&gt;
If you have any questions at any time about the study or procedures, please contact Dr. Daniel Andresen&lt;br /&gt;
at Kansas State University, Department of Computer Science: Phone: (785) 532-7914 or Email:&lt;br /&gt;
dan@ksu.edu.&lt;br /&gt;
If you feel you have not been treated according to the description in this page, or your rights as a&lt;br /&gt;
participant in research have been violated during the course of this study, you may contact the office for&lt;br /&gt;
the Kansas State University Committee on Research Involving Human Subjects, 203 Fairchild Hall, Kansas&lt;br /&gt;
State University, Manhattan, KS 66506. (785) 532-3224.&lt;br /&gt;
=== PARTICIPATION ===&lt;br /&gt;
&lt;br /&gt;
Your participation in this study is strictly voluntary; you may refuse to participate in any followup&lt;br /&gt;
surveys or withdraw your information from the study without penalty. If you decide to participate, you&lt;br /&gt;
may withdraw from the study at any time without penalty. To remove your data from use in the study,&lt;br /&gt;
contact Dr. Daniel Andresen as described above.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=SlurmBasics&amp;diff=419</id>
		<title>SlurmBasics</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=SlurmBasics&amp;diff=419"/>
		<updated>2018-09-24T18:44:13Z</updated>

		<summary type="html">&lt;p&gt;Dan: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== The CentOS/Slurm nodes ==&lt;br /&gt;
&lt;br /&gt;
We have converted Beocat from Gentoo Linux to CentOS Linux on December 26th of 2017.  Any applications or libraries from the old system must be recompiled.  We also converted Beocat to use the Slurm scheduler instead of SGE.  You will therefore also need to convert all your old qsub scripts over to sbatch scripts.  We have developed tools to make this process as easy as possible.  &lt;br /&gt;
&lt;br /&gt;
&amp;lt;H3&amp;gt;Using Modules&amp;lt;/H3&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If you're using a common code that others may also be using, we may already have it compiled in a module.  You can list the modules available and load an application as in the example below for Vasp.&lt;br /&gt;
&lt;br /&gt;
eos&amp;gt;  &amp;lt;B&amp;gt;module avail&amp;lt;/B&amp;gt;&amp;lt;BR&amp;gt;&lt;br /&gt;
eos&amp;gt;  &amp;lt;B&amp;gt;module load VASP&amp;lt;/B&amp;gt;&amp;lt;BR&amp;gt;&lt;br /&gt;
eos&amp;gt;  &amp;lt;B&amp;gt;module list&amp;lt;/B&amp;gt;&lt;br /&gt;
&lt;br /&gt;
When a module gets loaded, all the necessary libraries are also loaded and the paths to the libraries and executables are automatically set up.  Loading Vasp for example also loads the OpenMPI library needed to run it and adds the path to the MPI commands and Vasp executables.   To see how the path is set up, try executing &amp;lt;B&amp;gt;&amp;lt;I&amp;gt;which vasp_std&amp;lt;/I&amp;gt;&amp;lt;/B&amp;gt;.  The module system allows you to easily switch between different version of applications, libraries, or languages as well.&lt;br /&gt;
&lt;br /&gt;
If you are using a custom code or one that is not installed in a module, you'll need to recompile it yourself.  This process is easier under CentOS as some of the work just involves loading the necessary set of modules.  The first step is to decide whether to use the Intel compiler toolchain or the GNU toolchain, each of which includes the compilers and other math libraries.  The module commands for each are below, and you can load these automatically when you log in by adding one of these module load statements to your .bashrc file.  See &amp;lt;B&amp;gt;/homes/daveturner/.bashrc&amp;lt;/B&amp;gt; as an example, where I put the module load statements.&lt;br /&gt;
&lt;br /&gt;
To load the Intel compiler tool chain including the Intel Math Kernel Library:&amp;lt;BR&amp;gt;&lt;br /&gt;
eos&amp;gt;  &amp;lt;B&amp;gt;module load iomkl&amp;lt;/B&amp;gt;&amp;lt;BR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
To load the GNU compiler tool chain including OpenBLAS, FFTW, and ScalaPack load foss (free open source software):&amp;lt;BR&amp;gt;&lt;br /&gt;
eos&amp;gt;  &amp;lt;B&amp;gt;module load foss&amp;lt;/B&amp;gt;&amp;lt;BR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
To load the OpenMPI toolchain to compile (mpicc) and run (mpirun) MPI programs:&amp;lt;BR&amp;gt;&lt;br /&gt;
eos&amp;gt;  &amp;lt;B&amp;gt;module load OpenMPI&amp;lt;/B&amp;gt;&amp;lt;BR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Modules provide an easy way to set up the compilers and libraries you may need to compile your code.  Beyond that there are many different ways to compile codes so you'll just need to follow the directions.  If you need help you can always email us at &amp;lt;B&amp;gt;beocat@cs.ksu.edu&amp;lt;/B&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;H3&amp;gt;Converting your qsub script for sbatch using &amp;lt;I&amp;gt;kstat.convert&amp;lt;/I&amp;gt;&amp;lt;/H3&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If you already have a qsub script, I have created a new perl program called kstat.convert that will automatically convert your qsub script over to an sbatch script.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;B&amp;gt;kstat.convert --sge qsub_script.sh --slurm slurm_script.sh&amp;lt;/B&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Below is an example of a simple qsub script and the resulting sbatch script after conversion.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
#!/bin/bash&lt;br /&gt;
#$ -j y&lt;br /&gt;
#$ -cwd&lt;br /&gt;
#$ -N netpipe&lt;br /&gt;
#$ -P KSU-CIS-HPC&lt;br /&gt;
&lt;br /&gt;
#$ -l mem=4G&lt;br /&gt;
#$ -l h_rt=100:00:00&lt;br /&gt;
#$ -pe single 32&lt;br /&gt;
&lt;br /&gt;
#$ -M daveturner@ksu.edu&lt;br /&gt;
#$ -m ab&lt;br /&gt;
&lt;br /&gt;
mpirun -np $NSLOTS NPmpi -o np.out&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
#!/bin/bash -l&lt;br /&gt;
#SBATCH --job-name=netpipe&lt;br /&gt;
&lt;br /&gt;
#SBATCH --mem-per-cpu=4G   # Memory per core, use --mem= for memory per node&lt;br /&gt;
#SBATCH --time=4-04:00:00   # Use the form DD-HH:MM:SS&lt;br /&gt;
#SBATCH --nodes=1&lt;br /&gt;
#SBATCH --ntasks-per-node=32&lt;br /&gt;
&lt;br /&gt;
#SBATCH --mail-user=daveturner@ksu.edu&lt;br /&gt;
#SBATCH --mail-type=ALL   # same as =BEGIN,FAIL,END&lt;br /&gt;
&lt;br /&gt;
mpirun -np $SLURM_NPROCS NPmpi -o np.out&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The sbatch file uses &amp;lt;B&amp;gt;#SBATCH&amp;lt;/B&amp;gt; to identify command options for the scheduler where the qsub file uses &amp;lt;B&amp;gt;#$&amp;lt;/B&amp;gt;.  Most options are similar but simply use a different syntax.  The memory can still be defined on a per core basis as with SGE, or you can use &amp;lt;B&amp;gt;--mem=128G&amp;lt;/B&amp;gt; to specify the total memory per node if you'd prefer.  The &amp;lt;B&amp;gt;--nodes=&amp;lt;/B&amp;gt; and &amp;lt;B&amp;gt;--ntasks-per-node=&amp;lt;/B&amp;gt; provide an easy way to request the core configuration you want.  If your code can be distributed across multiple nodes and you don't care what the arrangement is, you can instead just specify the number of cores using &amp;lt;B&amp;gt;--ntasks=&amp;lt;/B&amp;gt;.  For more in depth documentation on converting from SGE to Slurm follow the links below:&lt;br /&gt;
&lt;br /&gt;
https://srcc.stanford.edu/sge-slurm-conversion&amp;lt;BR&amp;gt;&lt;br /&gt;
https://slurm.schedmd.com/sbatch.html&lt;br /&gt;
&lt;br /&gt;
&amp;lt;H3&amp;gt;Submitting jobs to Slurm&amp;lt;/H3&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Once your qsub script has been converted to an sbatch script and you have an application compiled for CentOS, you can submit the job using the &amp;lt;B&amp;gt;sbatch&amp;lt;/B&amp;gt; command.&lt;br /&gt;
&lt;br /&gt;
eos&amp;gt; &amp;lt;B&amp;gt;sbatch sbatch_script.sh&amp;lt;/B&amp;gt;&amp;lt;BR&amp;gt;&lt;br /&gt;
eos&amp;gt; &amp;lt;B&amp;gt;kstat  --me&amp;lt;/B&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This will submit the script and show you a list of your jobs that are running and the jobs you have in the queue.  By default the output for each job will go into a &amp;lt;B&amp;gt;slurm-###.out&amp;lt;/B&amp;gt; file where ### is the job ID number.  If you need to kill a job, you can use the &amp;lt;B&amp;gt;scancel&amp;lt;/B&amp;gt; command with the job ID number.&lt;br /&gt;
&lt;br /&gt;
== Submitting your first job ==&lt;br /&gt;
To submit a job to run under Slurm, we use the &amp;lt;B&amp;gt;&amp;lt;I&amp;gt;sbatch&amp;lt;/I&amp;gt;&amp;lt;/B&amp;gt; (submit batch) command.  The scheduler finds the optimum place for your job to run. With over 300 nodes and 7500 cores to schedule, as well as differing priorities, hardware, and individual resources, the scheduler's job is not trivial and it can take some time for a job to start even when there are empty nodes available.&lt;br /&gt;
&lt;br /&gt;
There are a few things you'll need to know before running sbatch.&lt;br /&gt;
* How many cores you need. Note that unless your program is created to use multiple cores (called &amp;quot;threading&amp;quot;), asking for more cores will not speed up your job. This is a common misperception. '''Beocat will not magically make your program use multiple cores!''' For this reason the default is 1 core.&lt;br /&gt;
* How much time you need. Many users when beginning to use Beocat neglect to specify a time requirement. The default is one hour, and we get asked why their job died after one hour. We usually point them to the [[FAQ]].&lt;br /&gt;
* How much memory you need. The default is 1 GB. If your job uses significantly more than you ask, your job will be killed off.&lt;br /&gt;
* Any advanced options. See the [[AdvancedSlurm]] page for these requests. For our basic examples here, we will ignore these.&lt;br /&gt;
&lt;br /&gt;
So let's now create a small script to test our ability to submit jobs. Create the following file (either by copying it to Beocat or by editing a text file and we'll name it &amp;lt;code&amp;gt;myhost.sh&amp;lt;/code&amp;gt;. Both of these methods are documented on our [[LinuxBasics]] page.&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot; line&amp;gt;&lt;br /&gt;
#!/bin/sh&lt;br /&gt;
srun hostname&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Be sure to make it executable&lt;br /&gt;
 chmod u+x myhost.sh&lt;br /&gt;
&lt;br /&gt;
So, now lets submit it as a job and see what happens. Here I'm going to use five options&lt;br /&gt;
* &amp;lt;code&amp;gt;--mem-per-cpu=&amp;lt;/code&amp;gt; tells how much memory I need. In my example, I'm using our system minimum of 512 MB, which is more than enough. Note that your memory request is '''per core''', which doesn't make much difference for this example, but will as you submit more complex jobs.&lt;br /&gt;
* &amp;lt;code&amp;gt;--time=&amp;lt;/code&amp;gt; tells how much runtime I need. This can be in the form of &amp;quot;minutes&amp;quot;, &amp;quot;minutes:seconds&amp;quot;, &amp;quot;hours:minutes:seconds&amp;quot;, &amp;quot;days-hours&amp;quot;, &amp;quot;days-hours:minutes&amp;quot; and &amp;quot;days-hours:minutes:seconds&amp;quot;. This is a very short job, so 1 minute should be plenty. This can't be changed after the job is started please make sure you have requested a sufficient amount of time.&lt;br /&gt;
* &amp;lt;code&amp;gt;--cpus-per-task=1&amp;lt;/code&amp;gt; tells Slurm that I need only a single core per task. The [[AdvancedSlurm]] page has much more on the &amp;quot;cpus-per-task&amp;quot; switch.&lt;br /&gt;
* &amp;lt;code&amp;gt;--ntasks=1&amp;lt;/code&amp;gt; tells Slurm that I only need to run 1 task. The [[AdvancedSlurm]] page has much more on the &amp;quot;ntasks&amp;quot; switch.&lt;br /&gt;
* &amp;lt;code&amp;gt;--nodes=1&amp;lt;/code&amp;gt; tells Slurm that this must be run on one machine. The [[AdvancedSlurm]] page has much more on the &amp;quot;nodes&amp;quot; switch.&lt;br /&gt;
* &amp;lt;code&amp;gt;--nodes=4 --ntasks-per-node=16 --constraint=elves&amp;lt;/code&amp;gt; requests 4 nodes with 16 cores on each and to only use the Elves.&lt;br /&gt;
&lt;br /&gt;
 % '''ls'''&lt;br /&gt;
 myhost.sh&lt;br /&gt;
 % '''sbatch --time=1 --mem-per-cpu=512M --cpus-per-task=1 --ntasks=1 --nodes=1 ./myhost.sh'''&lt;br /&gt;
 salloc: Granted job allocation 1483446&lt;br /&gt;
&lt;br /&gt;
Since this is such a small job, it is likely to be scheduled almost immediately, so a minute or so later, I now see&lt;br /&gt;
 % '''ls'''&lt;br /&gt;
 myhost.sh&lt;br /&gt;
 slurm-1483446.out&lt;br /&gt;
&lt;br /&gt;
 % '''cat slurm-1483446.out'''&lt;br /&gt;
 mage03&lt;br /&gt;
&lt;br /&gt;
== Monitoring Your Job ==&lt;br /&gt;
&lt;br /&gt;
The &amp;lt;B&amp;gt;kstat&amp;lt;/B&amp;gt; perl script has been developed at K-State to provide you with all the available information about your jobs on Beocat.  &amp;lt;B&amp;gt;kstat --help&amp;lt;/B&amp;gt; will give you a full description of how to use it.&lt;br /&gt;
The Slurm version of kstat is very similar to the SGE version, with the exception that the actual memory usage of each job is not always available so the&lt;br /&gt;
memory requested is reported, and the memory usage on each node is not always accurate since Slurm includes disk cache.  We are continuing to look&lt;br /&gt;
for better ways to get the memory usage for each job, but at the moment you may need to use [http://ganglia.beocat.ksu.edu/ Ganglia] and look at the&lt;br /&gt;
memory graph for the node you are running on to get an accurate idea of the memory being used by your application.&lt;br /&gt;
&lt;br /&gt;
Eos&amp;gt;  kstat --help&lt;br /&gt;
&lt;br /&gt;
 USAGE: kstat [-q] [-c] [-g] [-l] [-u user] [-p NaMD] [-j 1234567] [--part partition]&lt;br /&gt;
       kstat alone dumps all info except for the core summaries&lt;br /&gt;
       choose -q -c for only specific info on queued or core summaries.&lt;br /&gt;
       then specify any searchables for the user, program name, or job id&lt;br /&gt;
 &lt;br /&gt;
 kstat                 info on running and queued jobs&lt;br /&gt;
 kstat -q              info on the queued jobs only&lt;br /&gt;
 kstat -c              core usage for each user&lt;br /&gt;
 kstat -g              gpu nodes only&lt;br /&gt;
 kstat -l -h           long list - prints full node list&lt;br /&gt;
 kstat -u daveturner   job info for one user only&lt;br /&gt;
 kstat --me            job info for my jobs only&lt;br /&gt;
 kstat -j 1234567      info on a given job id&lt;br /&gt;
 kstat --nocolor       do not use any color&lt;br /&gt;
 &lt;br /&gt;
 --------------------------------------------------------------------------&lt;br /&gt;
   Multi-node jobs are highlighted in Magenta&lt;br /&gt;
      The switch and nodes/switch are on the right&lt;br /&gt;
      highlighted in Yellow when nodes are spread across multiple switches&lt;br /&gt;
   Shared jobs are highlighted in Cyan&lt;br /&gt;
   Memory requested is reported along with the total used when available&lt;br /&gt;
      Total RSS / Total VMSize / Total requested&lt;br /&gt;
   Runtime is colorized with yellow then red for jobs nearing their time limit&lt;br /&gt;
   Time in the queue is colorized yellow then red for jobs waiting long times&lt;br /&gt;
 --------------------------------------------------------------------------&lt;br /&gt;
&lt;br /&gt;
kstat can be used to give you a summary of your jobs that are running and in the queue:&amp;lt;BR&amp;gt;&lt;br /&gt;
&amp;lt;B&amp;gt;Eos&amp;gt;  kstat --me&amp;lt;/B&amp;gt;&amp;lt;BR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;b&amp;gt;&lt;br /&gt;
&amp;lt;font color=Brown&amp;gt;Hero43 &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=Blue&amp;gt;24 of 24 cores &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt;Load 23.4 / 24 &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=Red&amp;gt;495.3 / 512 GB used&amp;lt;/font&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&lt;br /&gt;
&amp;lt;font color=lightgreen&amp;gt;daveturner &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt;unafold &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp; 1234567 &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=cyan&amp;gt;1 core &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=green&amp;gt;running &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt; 4gb req &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt; 0 d  5 h 35 m &amp;lt;/font&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&lt;br /&gt;
&amp;lt;font color=green&amp;gt;daveturner &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt;octopus &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp; 1234568 &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=cyan&amp;gt;16 core &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=green&amp;gt;running &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=red&amp;gt; 128gb req &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt; 8 d 15 h 42 m &amp;lt;/font&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;font color=green&amp;gt; ##################################   BeoCat Queue    ################################### &amp;lt;/font&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&lt;br /&gt;
&amp;lt;font color=green&amp;gt;daveturner &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt;NetPIPE &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp; 1234569 &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp; &amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=cyan&amp;gt;2 core &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=red&amp;gt; PD &amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt; 2h &amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt; 4gb req &amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;/font&amp;gt;&lt;br /&gt;
&amp;lt;font color=black&amp;gt; 0 d 1 h 2 m &amp;lt;/font&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;/b&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;b&amp;gt;kstat&amp;lt;/b&amp;gt; produces a separate line for each host.  Use &amp;lt;b&amp;gt;kstat -h&amp;lt;/b&amp;gt; to see information on all hosts without the jobs.&lt;br /&gt;
For the example above we are listing our jobs and the hosts they are on.&lt;br /&gt;
&lt;br /&gt;
Core usage - yellow for empty, red for empty on owned nodes, cyan for partially used, blue for all cores used.&amp;lt;BR&amp;gt;&lt;br /&gt;
Load level - yellow or yellow background indicates the node is being inefficiently used.  Red just means more threads than cores.&amp;lt;br&amp;gt;&lt;br /&gt;
Memory usage - yellow or red means most memory is used.&amp;lt;BR&amp;gt;&lt;br /&gt;
If the node is owned the group name will be in orange on the right.  Killable jobs can still be run on those nodes.&amp;lt;BR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Each job line will contain the username, program name, job ID, number of cores, the status which may be colored red for killable jobs, &lt;br /&gt;
the maximum memory used or memory requested, and the amount of time the job has run.  &lt;br /&gt;
Jobs in the queue may contain information on the requested memory and run time, priority access, constraints, and&lt;br /&gt;
how long the job has been in the queue.&lt;br /&gt;
In this case, I have 2 jobs running on Hero43.  &amp;lt;i&amp;gt;unafold&amp;lt;/i&amp;gt; is using 1 core while &amp;lt;i&amp;gt;octopus&amp;lt;/i&amp;gt; is using 16 cores.  Slurm did not provide&lt;br /&gt;
any information on the actual memory use so the memory request is reported  &lt;br /&gt;
&lt;br /&gt;
&amp;lt;B&amp;gt;Detailed information about a single job&amp;lt;/B&amp;gt;&lt;br /&gt;
&lt;br /&gt;
kstat can provide a get a great deal of information on a particular job including a very rough estimate of when it will run.  This time is a worst case scenario as this will&lt;br /&gt;
be adapted as other jobs finish early.  This is a good way to check for job submission problems before contacting us.  kstat colorizes the more important&lt;br /&gt;
information to make it easier to identify.&lt;br /&gt;
&lt;br /&gt;
Eos&amp;gt;  kstat -j 157054&lt;br /&gt;
 &lt;br /&gt;
 ##################################   Beocat Queue    ###################################&lt;br /&gt;
  daveturner  netpipe     157054   64 cores  PD       dwarves fabric  CS HPC     8gb req   0 d  0 h  0 m&lt;br /&gt;
 &lt;br /&gt;
 JobId 157054  Job Name  netpipe&lt;br /&gt;
   UserId=daveturner GroupId=daveturner_users(2117) MCS_label=N/A&lt;br /&gt;
   Priority=11112 Nice=0 Account=ksu-cis-hpc QOS=normal&lt;br /&gt;
   Status=PENDING Reason=Resources Dependency=(null)&lt;br /&gt;
   Requeue=1 Restarts=0 BatchFlag=1 Reboot=0 ExitCode=0:0&lt;br /&gt;
   RunTime=00:00:00 TimeLimit=00:40:00 TimeMin=N/A&lt;br /&gt;
   SubmitTime=2018-02-02T18:18:31 EligibleTime=2018-02-02T18:18:31&lt;br /&gt;
   Estimated Start Time is 2018-02-03T06:17:49 EndTime=2018-02-03T06:57:49 Deadline=N/A&lt;br /&gt;
   PreemptTime=None SuspendTime=None SecsPreSuspend=0&lt;br /&gt;
   Partitions killable.q,ksu-cis-hpc.q AllocNode:Sid=eos:1761&lt;br /&gt;
   ReqNodeList=(null) ExcNodeList=(null)&lt;br /&gt;
   NodeList=(null) SchedNodeList=dwarf[01-02]&lt;br /&gt;
   NumNodes=2-2 NumCPUs=64 NumTasks=64 CPUs/Task=1 ReqB:S:C:T=0:0:*:*&lt;br /&gt;
   TRES 2 nodes 64 cores 8192  mem gres/fabric 2&lt;br /&gt;
   Socks/Node=* NtasksPerN:B:S:C=32:0:*:* CoreSpec=*&lt;br /&gt;
   MinCPUsNode=32 MinMemoryNode=4G MinTmpDiskNode=0&lt;br /&gt;
   Constraint=dwarves DelayBoot=00:00:00&lt;br /&gt;
   Gres=fabric Reservation=(null)&lt;br /&gt;
   OverSubscribe=OK Contiguous=0 Licenses=(null) Network=(null)&lt;br /&gt;
   Slurm script  /homes/daveturner/perf/NetPIPE-5.x/sb.np&lt;br /&gt;
   WorkDir=/homes/daveturner/perf/NetPIPE-5.x&lt;br /&gt;
   StdErr=/homes/daveturner/perf/NetPIPE-5.x/0.o157054&lt;br /&gt;
   StdIn=/dev/null&lt;br /&gt;
   StdOut=/homes/daveturner/perf/NetPIPE-5.x/0.o157054&lt;br /&gt;
   Switches=1@00:05:00&lt;br /&gt;
 &lt;br /&gt;
 #!/bin/bash -l&lt;br /&gt;
 #SBATCH --job-name=netpipe&lt;br /&gt;
 #SBATCH -o 0.o%j&lt;br /&gt;
 #SBATCH --time=0:40:00&lt;br /&gt;
 #SBATCH --mem=4G&lt;br /&gt;
 #SBATCH --switches=1&lt;br /&gt;
 #SBATCH --nodes=2&lt;br /&gt;
 #SBATCH --constraint=dwarves&lt;br /&gt;
 #SBATCH --ntasks-per-node=32&lt;br /&gt;
 #SBATCH --gres=fabric:roce:1&lt;br /&gt;
 &lt;br /&gt;
 host=`echo $SLURM_JOB_NODELIST | sed s/[^a-z0-9]/\ /g | cut -f 1 -d ' '`&lt;br /&gt;
 nprocs=$SLURM_NTASKS&lt;br /&gt;
 openmpi_hostfile.pl $SLURM_JOB_NODELIST 1 hf.$host&lt;br /&gt;
 opts=&amp;quot;--printhostnames --quick --pert 3&amp;quot;&lt;br /&gt;
 &lt;br /&gt;
 echo &amp;quot;*******************************************************************&amp;quot;&lt;br /&gt;
 echo &amp;quot;Running on $SLURM_NNODES nodes $nprocs cores on nodes $SLURM_JOB_NODELIST&amp;quot;&lt;br /&gt;
 echo &amp;quot;*******************************************************************&amp;quot;&lt;br /&gt;
 &lt;br /&gt;
 mpirun -np 2 --hostfile hf.$host NPmpi $opts -o np.${host}.mpi&lt;br /&gt;
 mpirun -np 2 --hostfile hf.$host NPmpi $opts -o np.${host}.mpi.bi --async --bidir&lt;br /&gt;
 mpirun -np $nprocs NPmpi $opts -o np.${host}.mpi$nprocs --async --bidir&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;B&amp;gt;Completed jobs and memory usage&amp;lt;/B&amp;gt;&lt;br /&gt;
&lt;br /&gt;
kstat -d #&lt;br /&gt;
&lt;br /&gt;
This will provide information on the jobs you have currently running and those that have completed&lt;br /&gt;
in the last '#' days.  This is currently the only reliable way to get the memory used per node for your job.&lt;br /&gt;
This also provides information on whether the job completed normally, was canceled with &amp;lt;I&amp;gt;scancel&amp;lt;/I&amp;gt;, &lt;br /&gt;
timed out, or was killed because it exceeded its memory request.&lt;br /&gt;
&lt;br /&gt;
Eos&amp;gt;  kstat -d 10&lt;br /&gt;
&lt;br /&gt;
 ###########################  sacct -u daveturner  for 10 days  ###########################&lt;br /&gt;
                                      max gb used on a node /   gb requested per node&lt;br /&gt;
  193037   ADF         dwarf43           1 n  32 c   30.46gb/100gb    05:15:34  COMPLETED&lt;br /&gt;
  193289   ADF         dwarf33           1 n  32 c   26.42gb/100gb    00:50:43  CANCELLED&lt;br /&gt;
  195171   ADF         dwarf44           1 n  32 c   56.81gb/120gb    14:43:35  COMPLETED&lt;br /&gt;
  209518   matlab      dwarf36           1 n   1 c    0.00gb/  4gb    00:00:02  FAILED&lt;br /&gt;
&lt;br /&gt;
&amp;lt;B&amp;gt;Summary of core usage&amp;lt;/B&amp;gt;&lt;br /&gt;
&lt;br /&gt;
kstat can also provide a listing of the core usage and cores requested for each user.&amp;lt;BR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Eos&amp;gt;  kstat -c&lt;br /&gt;
 &lt;br /&gt;
 ##############################   Core usage    ###############################&lt;br /&gt;
   antariksh       1512 cores   %25.1 used     41528 cores queued&lt;br /&gt;
   bahadori         432 cores   % 7.2 used        80 cores queued&lt;br /&gt;
   eegoetz            0 cores   % 0.0 used         2 cores queued&lt;br /&gt;
   fahrialkan        24 cores   % 0.4 used        32 cores queued&lt;br /&gt;
   gowri             66 cores   % 1.1 used        32 cores queued&lt;br /&gt;
   jeffcomer        160 cores   % 2.7 used         0 cores queued&lt;br /&gt;
   ldcoates12        80 cores   % 1.3 used       112 cores queued&lt;br /&gt;
   lukesteg         464 cores   % 7.7 used         0 cores queued&lt;br /&gt;
   mike5454        1060 cores   %17.6 used       852 cores queued&lt;br /&gt;
   nilusha          344 cores   % 5.7 used         0 cores queued&lt;br /&gt;
   nnshan2014       136 cores   % 2.3 used         0 cores queued&lt;br /&gt;
   ploetz           264 cores   % 4.4 used        60 cores queued&lt;br /&gt;
   sadish           812 cores   %13.5 used         0 cores queued&lt;br /&gt;
   sandung           72 cores   % 1.2 used        56 cores queued&lt;br /&gt;
   zhiguang          80 cores   % 1.3 used       688 cores queued&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If you want to read more, continue on to our [[AdvancedSlurm]] page.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
	<entry>
		<id>https://support.beocat.ksu.edu/BeocatDocs/index.php?title=OLD_DEPRECATED_AdvancedSGE&amp;diff=212</id>
		<title>OLD DEPRECATED AdvancedSGE</title>
		<link rel="alternate" type="text/html" href="https://support.beocat.ksu.edu/BeocatDocs/index.php?title=OLD_DEPRECATED_AdvancedSGE&amp;diff=212"/>
		<updated>2017-04-19T19:01:38Z</updated>

		<summary type="html">&lt;p&gt;Dan: added -q \*@@dwarves&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Resource Requests ==&lt;br /&gt;
Aside from the time, RAM, and CPU requirements listed on the [[SGEBasics]] page, we have several other requestable resources. Generally, if you don't know if you need a particular resource, you should use the default. These can be generated with the command&lt;br /&gt;
 &amp;lt;tt&amp;gt;qconf -sc | awk '{ if ($5 != &amp;quot;NO&amp;quot;) { print }}'&amp;lt;/tt&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
!name&lt;br /&gt;
!shortcut&lt;br /&gt;
!type&lt;br /&gt;
!relop&lt;br /&gt;
!requestable&lt;br /&gt;
!consumable&lt;br /&gt;
!default&lt;br /&gt;
!urgency&lt;br /&gt;
|-&lt;br /&gt;
|arch&lt;br /&gt;
|a&lt;br /&gt;
|RESTRING&lt;br /&gt;
|==&lt;br /&gt;
|YES&lt;br /&gt;
|NO&lt;br /&gt;
|NONE&lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|avx&lt;br /&gt;
|avx&lt;br /&gt;
|BOOL        &lt;br /&gt;
|==     &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|FALSE    &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|calendar            &lt;br /&gt;
|c          &lt;br /&gt;
|RESTRING    &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|NONE     &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|cpu                 &lt;br /&gt;
|cpu        &lt;br /&gt;
|DOUBLE      &lt;br /&gt;
|&amp;gt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|cpu_flags           &lt;br /&gt;
|c_f        &lt;br /&gt;
|STRING      &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|NONE     &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|cuda                &lt;br /&gt;
|cuda       &lt;br /&gt;
|INT         &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|JOB        &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|display_win_gui     &lt;br /&gt;
|dwg        &lt;br /&gt;
|BOOL        &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|exclusive           &lt;br /&gt;
|excl       &lt;br /&gt;
|BOOL        &lt;br /&gt;
|EXCL    &lt;br /&gt;
|YES         &lt;br /&gt;
|YES        &lt;br /&gt;
|0        &lt;br /&gt;
|1000&lt;br /&gt;
|-&lt;br /&gt;
|h_core              &lt;br /&gt;
|h_core     &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|h_cpu               &lt;br /&gt;
|h_cpu      &lt;br /&gt;
|TIME        &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0:0:0    &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|h_data              &lt;br /&gt;
|h_data     &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|h_fsize             &lt;br /&gt;
|h_fsize    &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|h_rss               &lt;br /&gt;
|h_rss      &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|h_rt                &lt;br /&gt;
|h_rt       &lt;br /&gt;
|TIME        &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|FORCED      &lt;br /&gt;
|NO        &lt;br /&gt;
|0:0:0    &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|h_stack             &lt;br /&gt;
|h_stack    &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|h_vmem              &lt;br /&gt;
|h_vmem     &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|hostname            &lt;br /&gt;
|h          &lt;br /&gt;
|HOST        &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|NONE     &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|infiniband          &lt;br /&gt;
|ib         &lt;br /&gt;
|BOOL        &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|FALSE    &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|m_core              &lt;br /&gt;
|core       &lt;br /&gt;
|INT         &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|m_socket            &lt;br /&gt;
|socket     &lt;br /&gt;
|INT         &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|m_thread            &lt;br /&gt;
|thread     &lt;br /&gt;
|INT         &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|m_topology          &lt;br /&gt;
|topo       &lt;br /&gt;
|RESTRING    &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|NONE     &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|m_topology_inuse    &lt;br /&gt;
|utopo      &lt;br /&gt;
|RESTRING    &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|NONE     &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|mem_free            &lt;br /&gt;
|mf         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|mem_total           &lt;br /&gt;
|mt         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|mem_used            &lt;br /&gt;
|mu         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;gt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0       &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|memory              &lt;br /&gt;
|mem        &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|FORCED      &lt;br /&gt;
|YES        &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|num_proc            &lt;br /&gt;
|p          &lt;br /&gt;
|INT         &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|qname               &lt;br /&gt;
|q          &lt;br /&gt;
|RESTRING    &lt;br /&gt;
|==      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|NONE     &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|s_core              &lt;br /&gt;
|s_core     &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO        &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|s_cpu               &lt;br /&gt;
|s_cpu      &lt;br /&gt;
|TIME        &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0:0:0    &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|s_data              &lt;br /&gt;
|s_data     &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|s_fsize             &lt;br /&gt;
|s_fsize    &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|s_rss               &lt;br /&gt;
|s_rss      &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|s_rt                &lt;br /&gt;
|s_rt       &lt;br /&gt;
|TIME        &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0:0:0    &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|s_stack             &lt;br /&gt;
|s_stack    &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|s_vmem              &lt;br /&gt;
|s_vmem     &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|slots               &lt;br /&gt;
|s          &lt;br /&gt;
|INT         &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|YES        &lt;br /&gt;
|1        &lt;br /&gt;
|1000&lt;br /&gt;
|-&lt;br /&gt;
|swap_free           &lt;br /&gt;
|sf         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|swap_rate           &lt;br /&gt;
|sr         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;gt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|swap_rsvd           &lt;br /&gt;
|srsv       &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;gt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|swap_total          &lt;br /&gt;
|st         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|swap_used           &lt;br /&gt;
|su         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;gt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|virtual_free        &lt;br /&gt;
|vf         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|virtual_total       &lt;br /&gt;
|vt         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;lt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|virtual_used        &lt;br /&gt;
|vu         &lt;br /&gt;
|MEMORY      &lt;br /&gt;
|&amp;gt;=      &lt;br /&gt;
|YES         &lt;br /&gt;
|NO         &lt;br /&gt;
|0        &lt;br /&gt;
|0&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
The good news is that most of these nobody ever uses. There are a couple of exceptions, though:&lt;br /&gt;
=== Infiniband ===&lt;br /&gt;
First of all, let me state that just because it sounds &amp;quot;cool&amp;quot; doesn't mean you need it or even want it. Infiniband does absolutely no good if running in a 'single' parallel environment. Infiniband is a high-speed host-to-host communication fabric. It is used in conjunction with MPI jobs (discussed below). Several times we have had jobs which could run just fine, except that the submitter requested Infiniband, and all the nodes with Infiniband were currently busy. In fact, some of our fastest nodes do not have Infiniband, so by requesting it when you don't need it, you are actually slowing down your job. To request Infiniband, add &amp;lt;tt&amp;gt;-l ib=true&amp;lt;/tt&amp;gt; to your qsub command-line.&lt;br /&gt;
=== CUDA ===&lt;br /&gt;
[[CUDA]] is the resource required for GPU computing. We have a very small number of nodes which have GPUs installed. To request one of these nodes, add &amp;lt;tt&amp;gt;-l cuda=true&amp;lt;/tt&amp;gt; to your qsub command-line.&lt;br /&gt;
=== Exclusive ===&lt;br /&gt;
Some programs just don't play nicely with others. They will attempt to use all available memory or will try to use all the cores it can use. The way to be a nice neighbor if your program has this problem is to request exclusive use of a node with &amp;lt;tt&amp;gt;-l excl=true&amp;lt;/tt&amp;gt;. This can also be useful for benchmarking, where you can be sure that no other jobs are interfering with yours.&lt;br /&gt;
== Parallel Jobs ==&lt;br /&gt;
There are two ways jobs can run in parallel, ''intra''node and ''inter''node. '''Note: Beocat will not automatically make a job run in parallel.''' Have I said that enough? It's a common misperception.&lt;br /&gt;
=== Intranode jobs ===&lt;br /&gt;
Intranode jobs are easier to code and can take advantage of many common libraries, such as [http://openmp.org/wp/ OpenMP], or Java's threads. Many times, your program will need to know how many cores you want it to use. Many will use all available cores if not told explicitly otherwise. This can be a problem when you are sharing resources, as Beocat does. To request multiple cores, use the qsub directive '&amp;lt;tt&amp;gt;-pe single ''n''&amp;lt;/tt&amp;gt;', where ''n'' is the number of cores you wish to use. If your command can take an environment variable, you can use $nslots to tell how many cores you've been allocated.&lt;br /&gt;
=== Internode (MPI) jobs ===&lt;br /&gt;
&amp;quot;Talking&amp;quot; between nodes is trickier that talking between cores on the same node. The specification for doing so is called &amp;quot;[[wikipedia:Message_Passing_Interface|Message Passing Interface]]&amp;quot;, or MPI. We have [http://www.open-mpi.org/ OpenMPI] installed on Beocat for this purpose. Most programs written to take advantage of large multi-node systems will use MPI. You can tell if you have an MPI-enabled program because its directions will tell you to run '&amp;lt;tt&amp;gt;mpirun ''program''&amp;lt;/tt&amp;gt;'. Requesting MPI resources is only mildly more difficult than requesting single-node jobs. Instead of using '&amp;lt;tt&amp;gt;-pe single ''n''&amp;lt;/tt&amp;gt;' for your qsub request, you will use one of the following:&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
! Parallel Environment !! Description&lt;br /&gt;
|-&lt;br /&gt;
|mpi-fill&lt;br /&gt;
|This environment will use as many slots on each node as it can until it reaches the number of cores you have requested.&lt;br /&gt;
|-&lt;br /&gt;
|mpi-spread&lt;br /&gt;
|This environment will spread itself out over as many nodes as possible until it reaches the number of cores you have requested.&lt;br /&gt;
|-&lt;br /&gt;
|mpi-1&lt;br /&gt;
|This environment will allocate the slots you've requested 1 per node.&lt;br /&gt;
|-&lt;br /&gt;
|mpi-2&lt;br /&gt;
|This environment will allocate the slots you've requested 2 per node. You must request cores as a multiple of 2&lt;br /&gt;
|-&lt;br /&gt;
|mpi-4&lt;br /&gt;
|This environment will allocate the slots you've requested 4 per node. You must request cores as a multiple of 4&lt;br /&gt;
|-&lt;br /&gt;
|mpi-8&lt;br /&gt;
|This environment will allocate the slots you've requested 8 per node. You must request cores as a multiple of 8&lt;br /&gt;
|-&lt;br /&gt;
|mpi-10&lt;br /&gt;
|This environment will allocate the slots you've requested 10 per node. You must request cores as a multiple of 10&lt;br /&gt;
|-&lt;br /&gt;
|mpi-12&lt;br /&gt;
|This environment will allocate the slots you've requested 12 per node. You must request cores as a multiple of 12&lt;br /&gt;
|-&lt;br /&gt;
|mpi-16&lt;br /&gt;
|This environment will allocate the slots you've requested 16 per node. You must request cores as a multiple of 16&lt;br /&gt;
|-&lt;br /&gt;
|mpi-20&lt;br /&gt;
|This environment will allocate the slots you've requested 20 per node. You must request cores as a multiple of 20&lt;br /&gt;
|-&lt;br /&gt;
|mpi-80&lt;br /&gt;
|This environment will allocate the slots you've requested 80 per node. You must request cores as a multiple of 80&lt;br /&gt;
|}&lt;br /&gt;
Some quick examples:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tt&amp;gt;-pe mpi-4 16&amp;lt;/tt&amp;gt; will give you 4 chunks of 4 cores apiece. They might all happen to be allocated on the same node (16 cores), on 4 different nodes (4 cores each), on 3 nodes (8 cores on one and 4 cores on the other two), or on 2 nodes (8 cores each).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tt&amp;gt;-pe mpi-fill 40&amp;lt;/tt&amp;gt; will give you 40 cores, but will attempt to get them all on the same node.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tt&amp;gt;-pe mpi-fill 100&amp;lt;/tt&amp;gt; will give you 100 cores, and place them on as few nodes as possible. In this case it's likely you would get a full mage (80 cores) and either part of another mage (the remaining 20 cores) or one of the 20-core elves.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tt&amp;gt;-pe mpi-spread 40&amp;lt;/tt&amp;gt; will give you 40 cores, and will attempt to place each on a separate node.&lt;br /&gt;
== Requesting memory for multi-core jobs ==&lt;br /&gt;
All memory requests are '''per core'''. One of the more common scenarios is where somebody will need, say 20 cores and 400 GB of memory. So they will make a request like '&amp;lt;tt&amp;gt;-pe single 20, -l mem=400G&amp;lt;/tt&amp;gt;' This will never run, because what you are really requesting is 20 cores and 8000GB of memory (20 * 400). Since we have no nodes with 8000 terabytes of memory, the job will never run. In this case, you will divide the 400GB total memory request by the number of cores (20), so the correct command would be '&amp;lt;tt&amp;gt;-pe single 20, -l mem=20G&amp;lt;/tt&amp;gt;'.&lt;br /&gt;
== Other Handy SGE Features ==&lt;br /&gt;
=== Email status changes ===&lt;br /&gt;
One of the most commonly used options when submitting jobs not related to resource requests is to have have SGE email you when a job changes its status. This takes two directives to qsub: '&amp;lt;tt&amp;gt;-M ''someone@somewhere.com''&amp;lt;/tt&amp;gt;' will give the email address to which to send status updates. '&amp;lt;tt&amp;gt;-m abe&amp;lt;/tt&amp;gt;' is probably the most common directive given for ''when'' to send updates. This will send email messages when a job (a)borts, (b)egins, or (e)nds. Other possibilities are (s)uspended and (n)ever.&lt;br /&gt;
=== Job Naming ===&lt;br /&gt;
If you have several jobs in the queue, running the same script with different parameters, it's handy to have a different name for each job as it shows up in the queue. This is accomplished with the '&amp;lt;tt&amp;gt;-N ''JobName''&amp;lt;/tt&amp;gt;' qsub directive.&lt;br /&gt;
=== Combining Output Streams ===&lt;br /&gt;
Normally, SGE will create two files for output. One will be .e''jobnumber'' and the other .o''jobnumber''. If you want both of these to be combined into a single file, you can use the qsub directive '&amp;lt;tt&amp;gt;-j y&amp;lt;/tt&amp;gt;'.&lt;br /&gt;
=== Running from the Current Directory ===&lt;br /&gt;
By default, jobs run from your home directory. Many programs incorrectly assume that you are running the script from the current directory. You can use the '&amp;lt;tt&amp;gt;-cwd&amp;lt;/tt&amp;gt;' directive to change to the &amp;quot;current working directory&amp;quot; you used when submitting the job.&lt;br /&gt;
=== Running in a specific class of machine ===&lt;br /&gt;
If you want to run on a specific class of machines, e.g., the Dwarves, you can add the flag &amp;quot;-q \*@@dwarves&amp;quot; to select that queue.&lt;br /&gt;
=== SGE Environment Variables ===&lt;br /&gt;
Within an actual job, sometimes you need to know specific things about the running environment to setup your scripts correctly. Here is a listing of environment variables that SGE makes available to you. Of course the value of these variables will be different based on many different factors.&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
HOSTNAME=titan1.beocat&lt;br /&gt;
SGE_TASK_STEPSIZE=undefined&lt;br /&gt;
SGE_INFOTEXT_MAX_COLUMN=5000&lt;br /&gt;
SHELL=/usr/local/bin/sh&lt;br /&gt;
NHOSTS=2&lt;br /&gt;
SGE_O_WORKDIR=/homes/mozes&lt;br /&gt;
TMPDIR=/tmp/105.1.batch.q&lt;br /&gt;
SGE_O_HOME=/homes/mozes&lt;br /&gt;
SGE_ARCH=lx24-amd64&lt;br /&gt;
SGE_CELL=default&lt;br /&gt;
RESTARTED=0&lt;br /&gt;
ARC=lx24-amd64&lt;br /&gt;
USER=mozes&lt;br /&gt;
QUEUE=batch.q&lt;br /&gt;
PVM_ARCH=LINUX64&lt;br /&gt;
SGE_TASK_ID=undefined&lt;br /&gt;
SGE_BINARY_PATH=/opt/sge/bin/lx24-amd64&lt;br /&gt;
SGE_STDERR_PATH=/homes/mozes/sge_test.sub.e105&lt;br /&gt;
SGE_STDOUT_PATH=/homes/mozes/sge_test.sub.o105&lt;br /&gt;
SGE_ACCOUNT=sge&lt;br /&gt;
SGE_RSH_COMMAND=builtin&lt;br /&gt;
JOB_SCRIPT=/opt/sge/default/spool/titan1/job_scripts/105&lt;br /&gt;
JOB_NAME=sge_test.sub&lt;br /&gt;
SGE_NOMSG=1&lt;br /&gt;
SGE_ROOT=/opt/sge&lt;br /&gt;
REQNAME=sge_test.sub&lt;br /&gt;
SGE_JOB_SPOOL_DIR=/opt/sge/default/spool/titan1/active_jobs/105.1&lt;br /&gt;
ENVIRONMENT=BATCH&lt;br /&gt;
PE_HOSTFILE=/opt/sge/default/spool/titan1/active_jobs/105.1/pe_hostfile&lt;br /&gt;
SGE_CWD_PATH=/homes/mozes&lt;br /&gt;
NQUEUES=2&lt;br /&gt;
SGE_O_LOGNAME=mozes&lt;br /&gt;
SGE_O_MAIL=/var/mail/mozes&lt;br /&gt;
TMP=/tmp/105.1.batch.q&lt;br /&gt;
JOB_ID=105&lt;br /&gt;
LOGNAME=mozes&lt;br /&gt;
PE=mpi-fill&lt;br /&gt;
SGE_TASK_FIRST=undefined&lt;br /&gt;
SGE_O_HOST=loki&lt;br /&gt;
SGE_O_SHELL=/bin/bash&lt;br /&gt;
SGE_CLUSTER_NAME=beocat&lt;br /&gt;
REQUEST=sge_test.sub&lt;br /&gt;
NSLOTS=32&lt;br /&gt;
SGE_STDIN_PATH=/dev/null&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
Sometimes it is nice to know what hosts you have access to during a PE job. You would checkout the PE_HOSTFILE to know that. If your job has been restarted, it is nice to be able to change what happens rather than redoing all of your work. If this is the case, RESTARTED would equal 1. There are lots of useful Environment Variables there, I will leave it to you to identify the ones you want.&lt;br /&gt;
&lt;br /&gt;
Some of the most commonly-used variables we see used are $NSLOTS, $HOSTNAME, and $SGE_TASK_ID (used for array jobs, discussed below).&lt;br /&gt;
== Running from a qsub Submit Script ==&lt;br /&gt;
No doubt after you've run a few jobs you get tired of typing something like 'qsub -l mem=2G,h_rt=10:00 -pe single 8 -n MyJobTitle MyScript.sh'. How are you supposed to remember all of these every time? The answer is to create a 'submit script', which outlines all of these for you. Below is a sample submit script, which you can modify and use for your own purposes.&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
#!/bin/bash&lt;br /&gt;
&lt;br /&gt;
## A Sample qsub script created by Kyle Hutson&lt;br /&gt;
##&lt;br /&gt;
## Note: Usually a '#&amp;quot; at the beginning of the line is ignored. However, in&lt;br /&gt;
## the case of qsub, lines beginning with #$ are commands for qsub itself, so&lt;br /&gt;
## I have taken the convention here of starting *every* line with a '#', just&lt;br /&gt;
## Delete the first one if you want to use that line, and then modify it to&lt;br /&gt;
## your own purposes. The only exception here is the first line, which *must*&lt;br /&gt;
## be #!/bin/bash (or another valid shell).&lt;br /&gt;
&lt;br /&gt;
## Specify the amount of RAM needed _per_core_. Default is 1G&lt;br /&gt;
##$ -l mem=1G&lt;br /&gt;
&lt;br /&gt;
## Specify the maximum runtime. Default is 1 hour (1:00:00)&lt;br /&gt;
##$ -l h_rt=1:00:00&lt;br /&gt;
&lt;br /&gt;
## Require the use of infiniband. If you don't know what this is, you probably&lt;br /&gt;
## don't need it. Default is &amp;quot;FALSE&amp;quot;&lt;br /&gt;
##$ ib=TRUE&lt;br /&gt;
&lt;br /&gt;
## CUDA directive. If You don't know what this is, you probably don't need it&lt;br /&gt;
## Default is &amp;quot;FALSE&amp;quot;&lt;br /&gt;
##$ -l cuda=TRUE&lt;br /&gt;
&lt;br /&gt;
## Parallel environment. Syntax is '-pe Environment NumberOfCores' A list of&lt;br /&gt;
## valid environments can be found at&lt;br /&gt;
## https://support.beocat.ksu.edu/BeocatDocs/index.php/AdvancedSGE (section 2). One&lt;br /&gt;
## quick note here. Jobs requesting 16 or fewer cores tend to get scheduled&lt;br /&gt;
## fairly quickly. If you need a job that requires more than that, you might&lt;br /&gt;
## benefit from emailing us at beocat@cs.ksu.edu to see how we can assist in&lt;br /&gt;
## getting your job scheduled in a reasonable amount of time. Default is&lt;br /&gt;
## &amp;quot;single 1&amp;quot;&lt;br /&gt;
##$ -pe single 12&lt;br /&gt;
##$ -pe mpi-1 2&lt;br /&gt;
##$ -pe mpi-fill 20&lt;br /&gt;
##$ -pe mpi-spread 16&lt;br /&gt;
&lt;br /&gt;
## Checkpointing. Options are BLCR or dmtcp. Default is no checkpointing.&lt;br /&gt;
##$ -ckpt dmtcp&lt;br /&gt;
&lt;br /&gt;
## Use the current working directory instead of your home directory&lt;br /&gt;
##$ -cwd&lt;br /&gt;
&lt;br /&gt;
## Merge output and error text streams into a single stream&lt;br /&gt;
##$ -j y&lt;br /&gt;
&lt;br /&gt;
## Name my job, to make it easier to find in the queue&lt;br /&gt;
##$ -N MyJobTitle&lt;br /&gt;
&lt;br /&gt;
## And finally, we run the job we came here to do.&lt;br /&gt;
## $HOME/ProgramDir/ProgramName ProgramArguments&lt;br /&gt;
&lt;br /&gt;
## OR, for the case of MPI-capable jobs&lt;br /&gt;
## mpirun $HOME/path/MpiJobName&lt;br /&gt;
&lt;br /&gt;
## Send email when a job is aborted (a), begins (b), and/or ends (e)&lt;br /&gt;
##$ -m abe&lt;br /&gt;
&lt;br /&gt;
## Email address to send the email to based on the above line.&lt;br /&gt;
##$ -M myemail@ksu.edu&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Array Jobs ==&lt;br /&gt;
One of SGE's useful options is the ability to run &amp;quot;Array Jobs&amp;quot;&lt;br /&gt;
&lt;br /&gt;
It can be used with the following option to qsub.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
  -t n[-m[:s]]&lt;br /&gt;
     Submits  a  so  called  Array  Job,  i.e. an array of identical tasks being differentiated only by an index number and being treated by  Grid&lt;br /&gt;
     Engine almost like a series of jobs. The option argument to -t specifies the number of array job tasks and the index  number  which  will  be&lt;br /&gt;
     associated with the tasks. The index numbers will be exported to the job tasks via the environment variable SGE_TASK_ID. The option arguments&lt;br /&gt;
     n, m and s will be available through the environment variables SGE_TASK_FIRST, SGE_TASK_LAST and  SGE_TASK_STEPSIZE.&lt;br /&gt;
 &lt;br /&gt;
     Following restrictions apply to the values n and m:&lt;br /&gt;
 &lt;br /&gt;
            1 &amp;lt;= n &amp;lt;= 1,000,000&lt;br /&gt;
            1 &amp;lt;= m &amp;lt;= 1,000,000&lt;br /&gt;
            n &amp;lt;= m&lt;br /&gt;
 &lt;br /&gt;
     The task id range specified in the option argument may be a single number, a simple range of the form n-m or  a  range  with  a  step  size.&lt;br /&gt;
     Hence,  the task id range specified by 2-10:2 would result in the task id indexes 2, 4, 6, 8, and 10, for a total of 5 identical tasks, each&lt;br /&gt;
     with the environment variable SGE_TASK_ID containing one of the 5 index numbers.&lt;br /&gt;
 &lt;br /&gt;
     Array  jobs  are  commonly  used to execute the same type of operation on varying input data sets correlated with the task index number. The&lt;br /&gt;
     number of tasks in a array job is unlimited.&lt;br /&gt;
 &lt;br /&gt;
     STDOUT and STDERR of array job tasks will be written into different files with the default location&lt;br /&gt;
 &lt;br /&gt;
     &amp;lt;jobname&amp;gt;.['e'|'o']&amp;lt;job_id&amp;gt;'.'&amp;lt;task_id&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Examples ===&lt;br /&gt;
==== Change the Size of the Run ====&lt;br /&gt;
Array Jobs have a variety of uses, one of the easiest to comprehend is the following:&lt;br /&gt;
&lt;br /&gt;
I have an application, app1 I need to run the exact same way, on the same data set, with only the size of the run changing.&lt;br /&gt;
&lt;br /&gt;
My original script looks like this:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
#!/bin/bash&lt;br /&gt;
RUNSIZE=50&lt;br /&gt;
#RUNSIZE=100&lt;br /&gt;
#RUNSIZE=150&lt;br /&gt;
#RUNSIZE=200&lt;br /&gt;
app1 $RUNSIZE dataset.txt&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
For every run of that job I have to change the RUNSIZE variable, and submit each script. This gets tedious.&lt;br /&gt;
&lt;br /&gt;
With Array Jobs the script can be written like so:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
#!/bin/bash&lt;br /&gt;
#$ -t 50:200:50&lt;br /&gt;
RUNSIZE=$SGE_TASK_ID&lt;br /&gt;
app1 $RUNSIZE dataset.txt&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
I then submit that job, and SGE understands that it needs to run it 4 times, once for each task. It also knows that it can and should run these tasks in parallel.&lt;br /&gt;
&lt;br /&gt;
==== Choosing a Dataset ====&lt;br /&gt;
A slightly more complex use of Array Jobs is the following:&lt;br /&gt;
&lt;br /&gt;
I have an application, app2, that needs to be run against every line of my dataset. Every line changes how app2 runs slightly, but I need to compare the runs against each other.&lt;br /&gt;
&lt;br /&gt;
Originally I had to take each line of my dataset and generate a new submit script and submit the job. This was done with yet another script:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
 #!/bin/bash&lt;br /&gt;
 DATASET=dataset.txt&lt;br /&gt;
 scriptnum=0&lt;br /&gt;
 while read LINE&lt;br /&gt;
 do&lt;br /&gt;
     echo &amp;quot;app2 $LINE&amp;quot; &amp;gt; ${scriptnum}.sh&lt;br /&gt;
     qsub ${scriptnum}.sh&lt;br /&gt;
     scriptnum=$(( $scriptnum + 1 ))&lt;br /&gt;
 done &amp;lt; $DATASET&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
Not only is this needlessly complex, it is also slow, as qsub has to verify each job as it is submitted. This can be done easily with array jobs, as long as you know the number of lines in the dataset. This number can be obtained like so: wc -l dataset.txt in this case lets call it 5000.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
#!/bin/bash&lt;br /&gt;
#$ -t 1:5000&lt;br /&gt;
app2 `sed -n &amp;quot;${SGE_TASK_ID}p&amp;quot; dataset.txt`&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
This uses a subshell via `, and has the sed command print out only the line number $SGE_TASK_ID out of the file dataset.txt.&lt;br /&gt;
&lt;br /&gt;
Not only is this a smaller script, it is also faster to submit because it is one job instead of 5000, so qsub doesn't have to verify as many.&lt;br /&gt;
&lt;br /&gt;
To give you an idea about time saved: submitting 1 job takes 1-2 seconds. by extension if you are submitting 5000, that is 5,000-10,000 seconds, or 1.5-3 hours.&lt;br /&gt;
== Running jobs interactively ==&lt;br /&gt;
Some jobs just don't behave like we think they should, or need to be run with somebody sitting at the keyboard and typing in response to the output the computers are generating. Beocat has a facility for this, called 'qrsh'. qrsh uses the exact same command-line arguments as qsub. If no node is available with your resource requirements, qrsh will tell you&lt;br /&gt;
 Your &amp;quot;qrsh&amp;quot; request could not be scheduled, try again later.&lt;br /&gt;
Note that, like qsub, your interactive job will timeout after your allotted time has passed.&lt;br /&gt;
== Altering Job Requests ==&lt;br /&gt;
We generally do not support users to modify job parameters once the job has been submitted. It can be done, but there are numerous catches, and all of the variations can be a bit problematic; it is normally easier to simply delete the job and resubmit it with the right parameters. '''If your job doesn't start after modifying such parameters (after a reasonable amount of time), delete the job and resubmit it.'''&lt;br /&gt;
=== qalter ===&lt;br /&gt;
&amp;lt;tt&amp;gt;qalter&amp;lt;/tt&amp;gt; is the command that can be used to modify parameters of the job after it has been submitted. '''Note: resource requests (memory, runtime, et. al.) can only be modified on jobs that have yet to start running.'''&lt;br /&gt;
==== Changing resource requests ====&lt;br /&gt;
Syntax:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
qalter -l $all_resources $jobid&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
When modifying resource requests, you '''must''' specify all of the resources your job needs, not just the one you plan to change. If you just specify h_rt, it will drop the memory request. If you just specify memory, it will drop the h_rt. And so on. This leads to jobs failing to start.&lt;br /&gt;
==== Changing core requests ====&lt;br /&gt;
Syntax:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
qalter -pe $pe_name $number_of_cores $jobid&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
If you request more cores than are available in the parallel environment that you need, the job may fail to start.&lt;br /&gt;
: i.e. requesting 400 cores in the single environment will fail due to the fact that we have no machines with 400 cores.&lt;br /&gt;
==== Determining why a job is not running ====&lt;br /&gt;
Syntax:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
qalter -w v $jobid&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
This will output the scheduler's reasoning as to why the job has not started. Note that lines like:&lt;br /&gt;
 Job 1122334455 cannot run in PE &amp;quot;single&amp;quot; because it only offers 0 slots&lt;br /&gt;
Are usually red herrings. Sometimes they are indicative that the scheduler cannot meet the resources requests for that job at this moment in time.&lt;br /&gt;
&lt;br /&gt;
Sometimes you will see output like this:&lt;br /&gt;
 Job 1122334455 does not request 'forced' resource &amp;quot;memory&amp;quot; of queue instance batch.q@elf73.beocat&lt;br /&gt;
In this case the user performed a qalter and forgot to specify the memory request. The job will never run in this state.&lt;br /&gt;
&lt;br /&gt;
Other times it will have lots of lines like this:&lt;br /&gt;
 verification: found possible assignment with 1 slots&lt;br /&gt;
This indicates that the job should be scheduled shortly.&lt;br /&gt;
== Killable jobs ==&lt;br /&gt;
There are a growing number of machines within Beocat that are owned by a particular person or group. Normally jobs from users that aren't in the group designated by the owner of these machines cannot use them. This is because we have guaranteed that the nodes will be accessible and available to the owner at any given time. We will allow others to use these nodes if they designate their job as &amp;quot;killable.&amp;quot; If your job is designated as killable, your job will be able to use these nodes, but can (and will) be killed off at any point in time to make way for the designated owner's jobs. Jobs that are marked killable will be re-queued and may restart on another node.&lt;br /&gt;
&lt;br /&gt;
The way you would designate your job as killable is to add &amp;lt;tt&amp;gt;-l killable&amp;lt;/tt&amp;gt; to the '''&amp;lt;tt&amp;gt;qsub&amp;lt;/tt&amp;gt; or &amp;lt;tt&amp;gt;qrsh&amp;lt;/tt&amp;gt;''' arguments. This could be either on the command-line or in your script file.&lt;br /&gt;
&lt;br /&gt;
''Note: This is a submit-time only request, it cannot be added by a normal user after the job has been submitted.'' If you would like jobs modified to be '''killable''' after the jobs have been submitted (and it is too much work to &amp;lt;tt&amp;gt;qdel&amp;lt;/tt&amp;gt; the jobs and re-submit), send an e-mail to the administrators detailing the job ids and what you would like done.&lt;br /&gt;
&lt;br /&gt;
== Scheduling Priority ==&lt;br /&gt;
The scheduler uses a complex formula to determine the order that jobs get scheduled in.  Jobs in general get run in the order that they are submitted to the queue with the following exceptions.  Jobs for users in a group that owns nodes will immediately get scheduled on those nodes even if that means bumping existing jobs off.  Users in groups that have contributed funds to Beocat may have higher scheduling priority.  You can check the base scheduling priority of each group using &amp;lt;tt&amp;gt;qconf -sst&amp;lt;/tt&amp;gt;.   If you do not have a group your jobs are scheduled using BEODEFAULT.  The higher the priority, the faster your job will be moved to the front of the queue.  A fair scheduling algorithm adjusts this scheduling priority down as users in that group submit more jobs.  &lt;br /&gt;
&lt;br /&gt;
Since all users not in a group having higher priority get put into BEODEFAULT, the priority is always very low and each job gets scheduled in the order it was submitted.  Groups with a higher priority may jump ahead of the BEODEFAULT jobs, but if these groups are submitting lots of jobs their priority will become low as well.  Groups with the highest priority that are submitting the fewest jobs may see those jobs moved to the front of the queue quickly.&lt;br /&gt;
&lt;br /&gt;
When processing cores become available, the scheduler looks at the head of the queue to find jobs that will fit within the resources available.  Shorter jobs of 12 hours or less get marked as killable and will be run on nodes owned by other groups.  These jobs will jump past longer jobs when resources become available on owned nodes.  Many jobs in the queue may require more memory than is available on some nodes, so smaller memory jobs will be scheduled ahead of larger memory jobs on hosts with more limited memory.  &amp;lt;tt&amp;gt;kstat -q&amp;lt;/tt&amp;gt; will show you the order in the queue and allow you to see jobs marked as &amp;quot;killable&amp;quot; and those that require large memory.&lt;br /&gt;
&lt;br /&gt;
== Job Accounting ==&lt;br /&gt;
Some people may find it useful to know what their job did during its run. The qacct tool will read SGE's accounting file and give you summarized or detailed views on jobs that have run within Beocat.&lt;br /&gt;
=== qacct ===&lt;br /&gt;
This data can usually be used to diagnose two very common job failures.&lt;br /&gt;
==== Job debugging ====&lt;br /&gt;
It is simplest if you know the job number of the job you are trying to get information on.&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
# if you know the jobid, put it here:&lt;br /&gt;
qacct -j 1122334455&lt;br /&gt;
# if you don't know the job id, you can look at your jobs over some number of days in this case the past 14 days:&lt;br /&gt;
qacct -o $USER -d 14 -j&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===== My job didn't do anything when it ran! =====&lt;br /&gt;
 &amp;lt;tt&amp;gt;qname        batch.q             &lt;br /&gt;
 hostname     mage07.beocat       &lt;br /&gt;
 group        some_user_users        &lt;br /&gt;
 owner        some_user              &lt;br /&gt;
 project      BEODEFAULT          &lt;br /&gt;
 department   defaultdepartment   &lt;br /&gt;
 jobname      my_job_script.sh  &lt;br /&gt;
 jobnumber    1122334455          &lt;br /&gt;
 ...&lt;br /&gt;
 snipped to save space&lt;br /&gt;
 ...&lt;br /&gt;
 exit_status  1                   &amp;lt;/tt&amp;gt;&lt;br /&gt;
 &amp;lt;tt style=&amp;quot;color: red&amp;quot;&amp;gt;ru_wallclock 1s&amp;lt;/tt&amp;gt;&lt;br /&gt;
 &amp;lt;tt&amp;gt;ru_utime     0.030s&lt;br /&gt;
 ru_stime     0.030s&lt;br /&gt;
 ...&lt;br /&gt;
 snipped to save space&lt;br /&gt;
 ...&lt;br /&gt;
 arid         undefined&lt;br /&gt;
 category     -u some_user -q batch.q,long.q -l h_rt=604800,mem_free=1024.0M,memory=2G&amp;lt;/tt&amp;gt;&lt;br /&gt;
If you look at the line showing ru_wallclock. You can see that it shows 1s. This means that the job started and then promptly ended. This points to something being wrong with your submission script. Perhaps there is a typo somewhere in it.&lt;br /&gt;
&lt;br /&gt;
===== My job ran but didn't finish! =====&lt;br /&gt;
 &amp;lt;tt&amp;gt;qname        batch.q             &lt;br /&gt;
 hostname     scout59.beocat      &lt;br /&gt;
 group        some_user_users     &lt;br /&gt;
 owner        some_user           &lt;br /&gt;
 project      BEODEFAULT          &lt;br /&gt;
 department   defaultdepartment   &lt;br /&gt;
 jobname      my_job_script.sh           &lt;br /&gt;
 jobnumber    1122334455            &lt;br /&gt;
 ...&lt;br /&gt;
 snipped to save space&lt;br /&gt;
 ...            &lt;br /&gt;
 slots        1                   &amp;lt;/tt&amp;gt;&lt;br /&gt;
 &amp;lt;tt style=&amp;quot;color: red&amp;quot;&amp;gt;failed       37  : qmaster enforced h_rt, h_cpu, or h_vmem limit&amp;lt;/tt&amp;gt;&lt;br /&gt;
 &amp;lt;tt&amp;gt;exit_status  0                   &amp;lt;/tt&amp;gt;&lt;br /&gt;
 &amp;lt;tt style=&amp;quot;color: red&amp;quot;&amp;gt;ru_wallclock 21600s&amp;lt;/tt&amp;gt;&lt;br /&gt;
 &amp;lt;tt&amp;gt;ru_utime     0.130s&lt;br /&gt;
 ru_stime     0.020s&lt;br /&gt;
 ...&lt;br /&gt;
 snipped to save space&lt;br /&gt;
 ...&lt;br /&gt;
 arid         undefined&amp;lt;/tt&amp;gt;&lt;br /&gt;
 &amp;lt;tt style=&amp;quot;color: red&amp;quot;&amp;gt;category     -u some_user -q batch.q,long.q -l h_rt=21600,mem_free=512.0M,memory=1G&amp;lt;/tt&amp;gt;&lt;br /&gt;
If you look at the lines showing failed, ru_wallclock and category we can see some pointers to the issue.&lt;br /&gt;
It didn't finish because the scheduler (qmaster) enforced some limit. If you look at the category line, the only limit requested was h_rt. So it was a runtime (wallclock) limit.&lt;br /&gt;
Comparing ru_wallclock and the h_rt request, we can see that it ran until the h_rt time was hit, and then the scheduler enforce the limit and killed the job. You will need to resubmit the job and ask for more time next time.&lt;/div&gt;</summary>
		<author><name>Dan</name></author>
	</entry>
</feed>