IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0268740
(2002-10-10)
|
발명자
/ 주소 |
- Arimilli,Ravi Kumar
- Williams,Derek Edward
|
출원인 / 주소 |
- International Business Machines Corporation
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
4 인용 특허 :
19 |
초록
▼
A data processing system includes a global promotion facility containing a plurality of promotion bit fields, an interconnect, and a plurality of processing units coupled to the global promotion facility and to the interconnect. A first processing unit includes an instruction sequencing unit, an exe
A data processing system includes a global promotion facility containing a plurality of promotion bit fields, an interconnect, and a plurality of processing units coupled to the global promotion facility and to the interconnect. A first processing unit includes an instruction sequencing unit, an execution unit that executes an acquisition instruction to acquire a particular promotion bit field within the global promotion facility, and a promotion awareness facility. In response to the first processing unit snooping a request by a second processing unit for the particular promotion bit field, the first processing unit records an association between the second processing unit and the particular promotion bit field in the global promotion facility. After the request and release of the particular promotion bit field by the first processing unit, the first processing unit checks the promotion awareness facility for an association for the particular promotion bit and responsive to the checking, pushes the particular promotion bit field to the second processing unit utilizing an unsolicited operation on the interconnect such that no additional request by the second processing unit is required.
대표청구항
▼
What is claimed is: 1. A method of data processing within a data processing system having a global promotion facility and a plurality of processing units coupled by an interconnect, said plurality of processing units including first and second processing units and said global promotion facility inc
What is claimed is: 1. A method of data processing within a data processing system having a global promotion facility and a plurality of processing units coupled by an interconnect, said plurality of processing units including first and second processing units and said global promotion facility including a plurality of promotion bit fields, said method comprising: said first processing unit acquiring a particular promotion bit field within said global promotion facility; in response to the first processing unit snooping a request by the second processing unit for the particular promotion bit field, said first processing unit recording an association between said second processing unit and said particular promotion bit field within a promotion awareness facility; said first processing unit checking said promotion awareness facility for an association for said particular promotion bit; and in response to said checking, said first processing unit pushing said particular promotion bit field to the second processing unit utilizing an unsolicited operation on said interconnect such that no additional request by said second processing unit is required. 2. The method of claim 1, wherein pushing said promotion bit field comprises pushing a lock protecting access to an associated memory address. 3. The method of claim 1, wherein recording said association comprises recording said association in response to detecting that said request by said second processing unit was unsuccessful. 4. The method of claim 1, wherein: said method further comprises caching said particular promotion bit field within said first processing unit while said particular promotion bit field is held by said first processing unit; and said pushing said particular promotion bit field comprises pushing said particular promotion field in response to deallocating said particular promotion bit field from a cache of said first processing unit. 5. The method of claim 1, wherein said pushing said particular promotion bit field comprises pushing said particular promotion field in response to release of said promotion bit field by said first processing unit. 6. The method of claim 1, and further comprising removing said association from said promotion awareness facility in response to said first processing unit snooping a request by said second processing unit for a second promotion bit field among said plurality of promotion bit fields. 7. The method of claim 1, and further comprising removing said association from said promotion awareness facility in response to snooping an explicit removal request by said second processing unit. 8. A processing unit for a data processing system having a global promotion facility and a plurality of processing units coupled by an interconnect, said processing unit comprising: an instruction sequencing unit; an execution unit that executes an acquisition instruction to acquire a particular promotion bit field within said global promotion facility; and a promotion awareness facility that, responsive to the processing unit snooping a request by a second processing unit for the particular promotion bit field, records an association between said second processing unit and said particular promotion bit field, wherein after said request and release of said particular promotion bit field by said first processing unit, said first processing unit checks said promotion awareness facility for an association for said particular promotion bit and responsive to said checking, pushes said particular promotion bit field to the second processing unit utilizing an unsolicited operation on said interconnect such that no additional request by said second processing unit is required. 9. The processing unit of claim 8, wherein said promotion bit field comprises a lock. 10. The processing unit of claim 8, wherein said promotion awareness facility records said association in response to detecting that said request was unsuccessful. 11. The processing unit of claim 8, said processing unit including a cache that caches said particular promotion bit field while said particular promotion bit field is held by said processing unit, and wherein said processing unit pushes said particular promotion bit field to said second processing unit in response to deallocating said particular promotion bit field from the cache. 12. The processing unit of claim 8, wherein said processing unit pushes said particular promotion bit field to said second processing unit in response to release of said promotion bit field by said first processing unit. 13. The processing unit of claim 8, said processing unit removes said association from said promotion awareness facility in response to said first processing unit snooping a request by said second processing unit for a second promotion bit field among said plurality of promotion bit fields. 14. The processing unit of claim 8, said processing unit removes said association from said promotion awareness facility in response to snooping an explicit removal request by said second processing unit. 15. A data processing system, comprising: a global promotion facility containing a plurality of promotion bit fields; an interconnect; a plurality of processing units coupled to said global promotion facility and to the interconnect, wherein said plurality of processing units includes a second processing unit and a first processing unit, said first processing unit comprising: an instruction sequencing unit; an execution unit that executes an acquisition instruction to acquire a particular promotion bit field within said global promotion facility; and a promotion awareness facility that, responsive to the first processing unit snooping a request by the second processing unit for the particular promotion bit field, records an association between said second processing unit and said particular promotion bit field, wherein after said request and release of said particular promotion bit field by said first processing unit, said first processing unit checks said promotion awareness facility for an association for said particular promotion bit and responsive to said checking, pushes said particular promotion bit field to the second processing unit utilizing an unsolicited operation on said interconnect such that no additional request by said second processing unit is required. 16. The data processing system of claim 15, wherein said promotion bit field comprises a lock. 17. The data processing system of claim 15, wherein said promotion awareness facility records said association in response to detecting that said request was unsuccessful. 18. The data processing system of claim 15, said first processing unit including a cache that caches said particular promotion bit field while said particular promotion bit field is held by said first processing unit, and wherein said first processing unit pushes said particular promotion bit field to said second processing unit in response to deallocating said particular promotion bit field from the cache. 19. The data processing system of claim 15, wherein said first processing unit pushes said particular promotion bit field to said second processing unit in response to release of said promotion bit field by said first processing unit. 20. The data processing system of claim 15, said first processing unit removes said association from said promotion awareness facility in response to said first processing unit snooping a request by said second processing unit for a second promotion bit field among said plurality of promotion bit fields. 21. The data processing system of claim 15, said first processing unit removes said association from said promotion awareness facility in response to snooping an explicit removal request by said second processing unit.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.