`
`IEEE Xplore
`
`IEEE SA
`
`IEEE Spectrum
`
`More Sites
`
`Subscribe
`
`Subscribe
`
`Cart
`
`
`Create
`Account
`
`
`
`Perso
`Sign
`
`
`
`Browse My Settings Help
`
`Institutional Sign In
`
`Institutional Sign In
`
`All
`
`
`
`
`
`ADVANCED SEARCH
`
`Conferences > Proceedings of 1995 1st IEEE ...
`
`Thread prioritization: a thread scheduling mechanism for multiple-context parallel
`processors
`Publisher: IEEE
`
`Cite This
`
`
`A
`
`lerts
`
`Manage Content Alerts
`Add to Citation Alerts
`
`
`
`S. Fiske ; W.J. Dally All Authors
`
`32
`Patent
`Citations
`
`102
`Full
`Text Views
`
`3P
`
`aper
`Citations
`
`Abstract
`
`Authors
`
`References
`
`Citations
`
`Keywords
`
`Metrics
`
`More Like This
`
`Abstract:Multiple-context processors provide register resources that allow rapid context switching between several
`threads as a means of tolerating long communication and synchron... View more
`
` Metadata
`Abstract:
`Multiple-context processors provide register resources that allow rapid context switching between several threads as a
`means of tolerating long communication and synchronization latencies. When scheduling threads on such a processor,
`we must first decide which threads should have their state loaded into the multiple contexts, and second, which loaded
`thread is to execute instructions at any given time. In this paper we show that both decisions are important, and that
`incorrect choices can lead to serious performance degradation. We propose thread prioritization as a means of guiding
`both levels of scheduling. Each thread has a priority that can change dynamically, and that the scheduler uses to
`allocate as many computation resources as possible to critical threads. We briefly describe its implementation, and we
`show simulation performance results for a number of simple benchmarks in which synchronization performance is
`critical.< >
`
`Published in: Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture
`
`Date of Conference: 22-25 January 1995
`
`INSPEC Accession Number: 4881211
`
`Date Added to IEEE Xplore: 06 August 2002
`
`DOI: 10.1109/HPCA.1995.386541
`
`
`
` D
`
`ownl
`
`
`1
`
`TCL 1011
`
`
`
`Print ISBN:0-8186-6445-2
`
`Publisher: IEEE
`
`Conference Location: Raleigh, NC, USA
`
`Authors
`
`References
`
`Citations
`
`Keywords
`
`Metrics
`
`
`
`
`
`
`
`
`
`
`
`2
`
`TCL 1011
`
`More
`Like
`This
`Optimizing the time cost of parallel structures by scheduling parallel processes to access the critical section
`Proceedings ICCI `92: Fourth International Conference on Computing and Information
`Published: 1992
`Synchronization-Aware Scheduling for Virtual Clusters in Cloud
`IEEE Transactions on Parallel and Distributed Systems
`Published: 2015
`Show
`More
`
`
`IEEE Personal Account
`
`Purchase Details
`
`Profile Information
`
`Need Help?
`
`CHANGE
`USERNAME/PASSWORD
`
`PAYMENT OPTIONS
`
`VIEW PURCHASED
`DOCUMENTS
`
`COMMUNICATIONS
`PREFERENCES
`
`PROFESSION AND
`EDUCATION
`
`US & CANADA: +1 800 678
`4333
`
`WORLDWIDE: +1 732 981
`0060
`
`TECHNICAL INTERESTS
`
`CONTACT & SUPPORT
`
`Follow
`
`
`
`About IEEE Xplore | Contact Us | Help | Accessibility | Terms of Use | Nondiscrimination Policy | IEEE Ethics Reporting | Sitemap |
`IEEE Privacy Policy
`A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of
`humanity.
`
`© Copyright 2023 IEEE - All rights reserved.
`
`IEEE Account
`
`» Change Username/Password
`» Update Address
`Purchase Details
`
`» Payment Options
`» Order History
`» View Purchased Documents
`Profile Information
`
`» Communications Preferences
`» Profession and Education
`
`3
`
`TCL 1011
`
`
`
`» Technical Interests
`Need Help?
`
`» US & Canada: +1 800 678 4333
`» Worldwide: +1 732 981 0060
`» Contact & Support
`
` About IEEE Xplore Contact Us
`
`|
`
`
`
`|
`
`
`
` Help
`
`|
`
`
`
` Accessibility
`
`|
`
`
`
` Terms of Use
`
`|
`
`
`
` Nondiscrimination Policy
`
`|
`
`
`
` Sitemap
`
`|
`
`Privacy & Opting Out of Cookies
`
`A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
`© Copyright 2023 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
`
`4
`
`TCL 1011
`
`
Accessing this document will incur an additional charge of $.
After purchase, you can access this document again without charge.
Accept $ Charge
Still Working On It
This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.
Give it another minute or two to complete, and then try the refresh button.
A few More Minutes ... Still Working
It can take up to 5 minutes for us to download a document if the court servers are running slowly.
Thank you for your continued patience.
This document could not be displayed.
We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.
Your account does not support viewing this document.
You need a Paid Account to view this document. Click here to change your account type.
Your account does not support viewing this document.
Set your membership
status to view this document.
With a Docket Alarm membership, you'll
get a whole lot more, including:
- Up-to-date information for this case.
- Email alerts whenever there is an update.
- Full text search for other cases.
- Get email alerts whenever a new case matches your search.
One Moment Please
The filing “” is large (MB) and is being downloaded.
Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.
Your document is on its way!
If you do not receive the document in five minutes, contact support at support@docketalarm.com.
Sealed Document
We are unable to display this document, it may be under a court ordered seal.
If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.
Access Government Site
