text:
More New and Used
from Private Sellers
Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
Organization Development : The Process of Leading Organizational Change
ISBN13:by Donald L. Anderson
SAGE Publications, Inc
Questions About This Book?
Why should I rent this book?
Renting is easy, fast, and cheap! Renting from eCampus.com can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.
How do rental returns work?
Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!
What version or edition is this?
This is the 2nd edition with a publication date of 6/17/2011.
What is included with this book?
- The Used copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included.
- The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.
Covering classic and contemporary organization development (OD) techniques that guide individual, team, and organizational change, this textbook incorporates discussion of OD ethics into each chapter and offers thorough discussions of interventions at all levels. In-depth case studies that follow major content and process chapters allow students to immediately apply what they have learned. In today'¬"s challenging environment of increased globalization, rapidly changing technologies, economic pressures, and expectations in the contemporary workforce, this book is an essential tool.
Table of Contents
|p. ix
|p. x
|What is Organization Development?
|p. 1
|Organization Development Defined
|p. 2
|Change Is a Constant Pressure
|p. 3
|What Organization Development Looks Like
|p. 4
|What Organization Development Is Not
|p. 9
|Who This Book Is For
|p. 10
|Overview of the Book
|p. 11
|Analyzing Case Studies
|p. 12
|p. 15
|History of Organization Development
|p. 17
|Laboratory Training and T-Groups
|p. 18
|Action Research and Survey Feedback
|p. 20
|Management Practices
|p. 23
|Quality and Employee Involvement
|p. 27
|Organizational Culture
|p. 29
|Change Management, Strategic Change, and Reengineering
|p. 31
|Organizational Learning
|p. 32
|Organizational Effectiveness and Employee Engagement
|p. 34
|p. 35
|Core Values and Ethics of Organization Development
|p. 37
|Defining Values
|p. 38
|Why Are Values Important to the OD Practitioner?
|p. 38
|Core Values of Organization Development
|p. 39
|Changes to OD Values Over Time and the Values Debate
|p. 45
|Challenges to Holding Organization Development Values
|p. 47
|Statement of Organization Development Ethics
|p. 48
|p. 49
|p. 50
|Analyzing Opportunities for Organization Development Work at Northern County Legal Services
|p. 57
|Foundations of Organizational Change
|p. 61
|Levels and Characteristics of Organizational Change
|p. 63
|Models of Organizational Change: Systems Theory and Social Construction Approaches
|p. 64
|Organizations as Systems
|p. 64
|Organizations as Socially Constructed
|p. 75
|p. 83
|The Organization Development Practitioner and the Consulting Process
|p. 85
|The Consulting Relationship and Types of Consulting
|p. 86
|The Organization Development Consulting Model
|p. 88
|OD Practitioners: Who Are They and Where Do They Work?
|p. 90
|The Organization Development Consulting Profession
|p. 93
|The OD Consulting Process and Action Research
|p. 95
|p. 100
|Entry and Contracting
|p. 103
|p. 104
|p. 107
|p. 118
|Data Gathering
|p. 119
|The importance of Data Gathering
|p. 120
|Presenting Problems and Underlying Problems
|p. 121
|Data Gathering Process
|p. 122
|Data Gathering Methods
|p. 122
|Creating a Data Gathering Strategy and Proposing an Approach
|p. 139
|Ethical Issues With Data Gathering
|p. 143
|p. 143
|Proposing a Data Gathering Strategy at Aero Tech, Inc.
|p. 145
|Diagnosis and Feedback
|p. 151
|Diagnosis: Discovery, Assessment, Analysis, and Interpretation
|p. 152
|Finding Patterns by Analyzing Data
|p. 154
|Interpreting Data
|p. 160
|Selecting and Prioritizing Themes
|p. 161
|p. 163
|Recognizing Resistance
|p. 165
|Ethical Issues With Diagnosis and Giving Feedback
|p. 168
|p. 169
|Sorting Through the Data from Logan Elementary School
|p. 171
|An Introduction to Interventions
|p. 175
|Interventions Defined
|p. 177
|Why Interventions Fail
|p. 178
|Considerations in Selecting the Right Intervention Strategy
|p. 182
|Structuring and Planning Interventions for Success
|p. 187
|The Change Agent's Role in the Intervention
|p. 190
|Ethical Issues With Interventions
|p. 191
|Overview of Intervention Techniques
|p. 192
|p. 192
|Individual Interventions
|p. 195
|Individual Change and Reactions to Change
|p. 196
|Individual Instruments and Assessments
|p. 198
|p. 202
|p. 205
|360 Feedback
|p. 206
|Career Planning and Development
|p. 208
|p. 212
|Individual Type Styles at the Parks Department
|p. 213
|Team Interventions
|p. 217
|Defining Teams
|p. 218
|What Makes a Successful Team?
|p. 219
|Special Types of Teams
|p. 220
|Team Development
|p. 224
|Team-Building Interventions
|p. 224
|Intergroup Interventions
|p. 243
|p. 248
|Solving Team Challenges at DocSystems Billing, Inc.
|p. 250
|Whole Organization and Multiple Organization Interventions
|p. 259
|Characteristics of Contemporary Large-Scale Interventions
|p. 261
|Organizational Culture Assessment and Change
|p. 262
|Organization Design and Structure
|p. 265
|Directional Interventions
|p. 276
|Quality and Productivity Interventions
|p. 287
|Mergers and Acquisitions
|p. 291
|Transorganization or Interorganization Development
|p. 295
|p. 297
|Reorganizing Human Resources at ASP Software
|p. 300
|The Future of the Crossroads Center
|p. 306
|Sustaining Change, Evaluating, and Ending an Engagement
|p. 309
|Sustaining Change After the Intervention
|p. 310
|p. 315
|Ending an Engagement: Separation and Exit
|p. 321
|p. 323
|The Future of Organization Development
|p. 325
|Increasing Complexity of Change
|p. 325
|p. 327
|Changing Workforce Demographics
|p. 330
|Changing Nature of Work
|p. 332
|The Current State of OD: Strengths, Weaknesses, and Opportunities
|p. 335
|p. 338
|p. 339
|Author Index
|p. 361
|Subject Index
|p. 369
|About the Author
|p. 381
|Table of Contents provided by Ingram. All Rights Reserved.


text:
Catalog Products » Molecular Biology Reagents » PCR Cloning » Cloning Vectors » pGS-21a
DescriptionThe pGS-21a vector is designed for cloning, high-level expression and convenient purification of proteins fused with both 6xHis and GST. Two 6xHis sequences were introduced into the vector for easy detection and purification of fused proteins. The first 6xHis is fused to GST and the fused tag 6xHis-GST can be cleaved using enterokinase. The second 6xHis can be used for detection and further purification after the cleavage of 6xHis-GST.
StorageStore at -20°C.
Forward Sequencing PrimerDA0009: T7 (TAATACGACTCACTATAGGG)
Reverse Sequencing PrimerDA0010: T7 Terminator (GCTAGTTATTGCTCAGCGG)
Detailed MapF1 ori: 1061 - 1516
Polylinker: 834 - 892
Ampicillin: 1648 - 2508
Vector Sequence and Restriction Enzyme Map
Related Products

subset: commoncrawl


text:
New Sportsbook.ag customers: Make your 1st bet, get your 2nd bet free, 100%, winnings paid in cash.Join Now
Already have an account? Click here to view new Exclusive Rewards!
BERKELEY, Calif. (AP) - California cornerback Steve Williams will skip his senior season to enter the NFL draft.
Williams played 37 games over his three seasons with the Golden Bears and ranks sixth in school history with 25 career pass breakups. He also had 150 tackles, nine tackles for loss, one sack, six interceptions and three forced fumbles.
Williams says it was a difficult decision to leave Cal but that he feels the time is right to enter the NFL.
Williams is the second Cal player to leave early to enter the draft, joining star receiver Keenan Allen.
Copyright 2016The Associated PressAll Rights Reserved


text:
WESTFORD -- Preschoolers from Nashoba Valley Technical High School's Early Learning Center have made their way around the big school recently, visiting several different areas.
Welcome to your discussion forum: Sign in with a Disqus account or your social networking account for your comment to be posted immediately, provided it meets the guidelines. (READ HOW.) Comments made here are the sole responsibility of the person posting them; these comments do not reflect the opinion of The Sun. So keep it civil.
(Photo by Chris Pizzello/Invision/AP)
Will Rob Lowe replace Michael Strahan as Kelly Ripa's next TV partner?
Report says Rob Lowe is in talks to replace Michael Strahan on 'Live! With Kelly.'


text:
So I think I am having some issues with Group Blog.
I have been testing Groupblog (version 1.4.4) with WordPress 3.0 (Multisite enabled) and Buddypress 22.214.171.124. When it is enabled, I get the catchable fatal error at the bottom. It also is loading up all posts made by the group admin instead of creating a distinctly new blog.
Anyone know what might be going on? Thanks!


text:
Welcome to the First Congregational Church of Revere, Massachusetts. We are so glad you found us and hope you will join us for worship. We are an evangelical church and are a member of the Conservative Congregational Christian Conference. Our senior pastor is Rev. Nick Granitsas and our associate pastor is Pastor Tim Bogertman.
Our Sunday Services are at 8 and 11 am (nursery is provided at the 11 am service).
Sunday School starts at 9:15 am for children, youth, and adults (nursery is provided for infants/toddlers).
Our Food Pantry is open every Wednesday from 7-8:30 pm.
© First Congregational Church of Revere. All rights reserved. Site Credit


text: Personalised New Baby Boy Notebook by Made by Ellis £9.95$19.16€12.80$14.39 In stock £6.95$13.38€8.94$10.05 delivery to United States Receive this item 5-10 working days from dispatch International delivery available designdesign (required)Blue PramBlue Storkdesign (required)Blue PramBlue Storkdesign (required)Blue PramBlue Storkdesign (required)Blue PramBlue Stork personalisation on first line (required) personalisation on second line (required) have you double checked the spelling?have you double checked the spelling? (required)The spelling is correcthave you double checked the spelling? (required)The spelling is correcthave you double checked the spelling? (required)The spelling is correcthave you double checked the spelling? (required)The spelling is correct quantity by Made by Ellis Location: Bristol, GB read seller's profile see seller's complete range more items from this seller Personalised Baby Keepsake Box by Made by Ellis £23$44.30€29.60$33.26 Personalised New Baby Girl Notebook by Made by Ellis £9.95$19.16€12.80$14.39 Personalised New Baby Boy Announcement Cards by Made by Ellis £0.95$1.83€1.22$1.37 Personalised New Twins Announcement Cards by Made by Ellis £0.95$1.83€1.22$1.37 Personalised Baby Photo Album by Made by Ellis £35$67.42€45.05$50.62 Personalised Boy's Christening Invitations by Made by Ellis £0.95$1.83€1.22$1.37 view all you may also like PRODUCT DETAILS CUSTOMER REVIEWS DELIVERY RETURNS can be personalised ask seller a question save for later A personalised baby boy notebook with two designs to choose from. Perfect for keeping hold of all those first moments and memories. This high quality hardcover book contains 96 lined white pages and includes a ribbon marker, elastic pen holder and closure band, and it even has a handy storage pocket at the back. This would make a great present for new parents of a baby boy. The two lines of text on the front of the notebook can be personalised to make an extra special gift. One packaged notebook will fit through a standard letter box, so you don't need to worry about missing your delivery. Line one can be up to 18 characters long and line two can be up to 20 characters long. Both lines of text are written in capitals. If you don't want to use a line, please write 'leave blank' in the box. There are two designs to choose from: Blue Pram and Blue Stork. View the images above to see them both. made from: The notebook is hardbound in coated matt paper. dimensions: H15 x W11 x D1.5cm product code: 257441 2 customer reviews read about our product rating system ratings guide trusted independent customer feedbackforum excellent bad good poor This product is dispatched to you by Made by Ellis. MAINLAND UK order now and receive this item by price Standard Delivery Monday 6 June £1.75$3.37€2.25$2.53 Tracked Two Day Delivery Thursday 2 June £5.70$10.98€7.33$8.24 Tracked Next Day Delivery Wednesday 1 June £6.70$12.90€8.62$9.69 Tracked Next Day 1pm Delivery Wednesday 1 June £8.70$16.75€11.19$12.58 Saturday Delivery Saturday 4 June £14.70$28.31€18.92$21.26 NON-MAINLAND UK estimated delivery price Highlands & Islands of Scotland 2-5 working daysfrom dispatch £1.75$3.37€2.25$2.53 Northern Ireland 2-5 working daysfrom dispatch £1.75$3.37€2.25$2.53 Other UK Islands 2-5 working daysfrom dispatch £1.75$3.37€2.25$2.53 INTERNATIONAL DELIVERY estimated delivery price Western Europe 2-5 working daysfrom dispatch £5.00$9.63€6.43$7.23 Rest of Europe 5-10 working daysfrom dispatch £5.00$9.63€6.43$7.23 USA & Canada 5-10 working daysfrom dispatch £6.95$13.38€8.94$10.05 Asia & Australasia 5-10 working daysfrom dispatch £7.25$13.96€9.33$10.48 Rest of the world 5-14 working daysfrom dispatch £7.25$13.96€9.33$10.48 You have 28 days, from receipt of cancellable goods, to notify the seller if you wish to cancel your order or exchange an item. Please note: goods that are personalised, bespoke or made-to-order to your specific requirements, perishable products and personal items sold with a hygiene seal (cosmetics, underwear) in instances where the seal is broken are non-refundable, unless faulty. Read more about our returns policy.Should you choose to return or exchange your order you will need to deliver the item(s) to the UK, where this seller is based. Made by Ellis's return policy Please see notonthehighstreet.com's returns policy.


text:
Push firmly, accel pedal breaks loose, works fine. Camry has 4 cyl engine, Auto trans. Does not stay in place when I let up on pedal, only when starting from a stop, after driving for a little time,on or off cruise control. Does not stick all the time, but frequently.
by Mavrick50 in Marshall, MN on January 25, 2014


text:
- 16Promote
iPad Tablet Skins
Making Potionby F. C. Brooks
Skins are thin, easy-to-remove, vinyl decals for customizing your laptop . Skins are made from a patented material that eliminates air bubbles and wrinkles for easy application.
The Lyric that inspired this print was 'Love is a potion, mixed up by careless fools and it takes two…' I couldn't help but see the humour in that and I started thinking in vintage images and fonts, The song that inspired this DanceFriday print is 'Out the Blue' by Sub Focus. http://photoslyrics.com/2012/06/08/love-potion/


text:
Sophomore Alex Sanchez scored a game-high 15 points to lead the 49ers to a 62-52 Big West-opening win over Cal Poly.
Jan. 3, 2013
Box Score (html) | Box Score (PDF) | Photo Gallery
LONG BEACH - The Long Beach State women's basketball team continued to dominate at home as it opened Big West Conference play with a 62-52 victory over Cal Poly Thursday evening at the Walter Pyramid.
The 49ers extended their win streak to a season-long four games and improved to 7-2 at home. LBSU also picked up its third conference-opening victory in the last four years.
Long Beach State shot 41.8 percent from the floor, while holding Cal Poly to 28.2 percent, and held a narrow 45-43 edge on the boards.
Sophomore Alex Sanchez led the way with a game-high 15 points to go along with eight rebounds and four assists. Sophomore Ella Clark also had 12 points, while senior Mary Ochiltree and sophomore Bianka Balthazar each had 10. Sophomore Devin Hudson matched her season-best with 12 rebounds and finished with nine points.
Long Beach State (8-5, 1-0 Big West) was quick to get on the board as it controlled the tip before Clark drove to the basket for a layup at the 19:51 mark. After Cal Poly scored three quick points, the 49ers proceeded to go on a 12-6 run, capped by a Hudson put back, to pull ahead by five at 14-9 with 10:10 remaining.
The Mustangs responded with six unanswered points to take the lead at 17-14 and would go up by as many as six, before LBSU outscored Cal Poly, 10-4, over the final 2:30. Sigrid Skorpen drained a 3-pointer from the right corner with 12.8 seconds on the clock to tie it up at 29-29 at the break.
The 49ers went 12-for-27 (44.4 percent) from the field in the first half and were led by Clark's 12 points. Clark was a perfect 4-of-4 with three 3-pointers.
Cal Poly (6-6, 0-1 Big West) went up 32-29 in the first minute of the second period, but Long Beach State regained the advantage at 33-32 on back-to-back baskets from Ochiltree and Balthazar. After the Mustangs made a pair of free throws, they went cold on the offensive end with just two field goals over a nine-plus minute span. LBSU took advantage of the drought as it used a 13-4 spurt to open up an eight-point advantage (46-38).
A 3-pointer from Cal Poly's Kayla Griffin eventually closed the gap to five at 48-43 with 6:14 to play, but the 49ers came storming back as Sanchez started a 10-2 run with six-straight points that put Long Beach State on top, 58-45, with 3:05 to go.
The Mustangs pulled within nine before Balthazar sank a pair of free throws and Hudson had a fastbreak layup to seal the 62-52 victory.
Cal Poly finished the second half with a dismal 17.9 field goal percentage (7-of-39).
The Mustangs were led by Brittany Woodard's 14 points and seven rebounds, while Griffin added 12 points.
Long Beach State continues its Big West Conference slate on Saturday, Jan. 5, when it welcomes UC Santa Barbara to the Walter Pyramid for a 4 p.m. showdown.
Sport Links
- 2015-16 Season
- Statistics
- Weekly Release
- Quick Facts
- Preseason Prospectus
- Printable Roster
- Printable Schedule
- 2014-15 Season
- Final Statistics
- Final Weekly Release
- Beach Classic Results
- Media Guide
- General Information
- Ticket Information
- Team History
- Walter Pyramid
- Photo Galleries
- Related Links
- NCAA WBB Page
- Big West WBB Page
- Women's Basketball Mag
Media Guides
Section 1Covers & Introduction
Section 2Coaching Staff & Player Profiles
Section 32014-15 Season Review
Section 4Opponent Section
Section 5History & Records
Section 6Welcome to The Beach
More Headlines
Long Beach State Travels to San Diego for WNIT ...03/17/2015 - W. Basketball
The Long Beach State women's basketball team will be making its second postseason appearance in...
LBSU Women's Hoops Earns Second WNIT Bid in...03/16/2015 - W. Basketball
Long Beach State has earned an at-large berth in the 2015 Women's National Invitation Tournament ...
Meneses Continues to Shine but Beach Falls...03/11/2015 - W. Basketball
The fourth-seeded Long Beach State women's basketball team erased an 18-point deficit and then...
Long Beach State Women's Basketball Begins Big ...03/10/2015 - W. Basketball
The fourth-seeded Long Beach State women's basketball team will begin the postseason against No. ...
Raven Benton, Hallie Meneses Earn All-Big West ...03/09/2015 - W. Basketball
Long Beach State had two players named to the 2014-15 All-Big West Women's Basketball Team the...
LBSU Tops UC Riverside on Senior Night, Secures...03/07/2015 - W. Basketball
Senior Hallie Meneses stepped up big in her final regular-season game at the Walter Pyramid and...


text:
Im using Vista Mail as my default client on Vista 32bit laptop. Since last week whenever I start Vista mail, I get greeted by the error message saying :
The server you are connected to is using a security certificate that could not be verified
I tried to find out solution on web but dint got any, later I contacted ATT (my ISP) and they told me change few settings such as changing POP server to pop.att.yahoo.com and SMTP server to smtp.att.yahoo.com. Apart from these they also advised me to change the SMTP port to 465 and POP3 port to 995, and also to keep Use an encrypted connection (SSL) check marked.
I did all these things but still while starting Vista Mail, I get the same error. Hope any of you guys can help me out in this.


text:
|Publication number
|Publication type
|Application number
|Publication date
|Apr 27, 2004
|Filing date
|Aug 17, 2001
|Priority date
|Aug 21, 2000
|Fee status
|Also published as
|Publication number
|Gerard Chauvel, Serge Lasserre
|Original Assignee
|Texas Instruments Incorporated
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (12), Non-Patent Citations (1), Referenced by (10), Classifications (40), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
This application claims priority to European Application Serial No. 00402331.3, filed Aug. 21, 2000 and to European Application Serial No. 01400689.4, filed Mar. 15, 2001. U.S. patent application Ser. No. 09/932,651 is incorporated herein by reference.
This invention generally relates to microprocessors, and more specifically to improvements in cache memory and access circuits, systems, and methods of making.
Microprocessors are general purpose processors which provide high instruction throughputs in order to execute software running thereon, and can have a wide range of processing requirements depending on the particular software applications involved. A cache architecture is often used to increase the speed of retrieving information from a main memory. A cache memory is a high speed memory that is situated between the processing core of a processing device and the main memory. The main memory is generally much larger than the cache, but also significantly slower. Each time the processing core requests information from the main memory, the cache controller checks the cache memory to determine whether the address being accessed is currently in the cache memory. If so, the information is retrieved from the faster cache memory instead of the slower main memory to service the request. If the information is not in the cache, the main memory is accessed, and the cache memory is updated with the information.
Many different types of processors are known, of which microprocessors are but one example. For example, Digital Signal Processors (DSPs) are widely used, in particular for specific applications, such as mobile processing applications. DSPs are typically configured to optimize the performance of the applications concerned and to achieve this they employ more specialized execution units and instruction sets. Particularly in applications such as mobile telecommunications, but not exclusively, it is desirable to provide ever increasing DSP performance while keeping power consumption as low as possible.
To further improve performance of a digital system, two or more processors can be interconnected. For example, a DSP may be interconnected with a general purpose processor in a digital system. The DSP performs numeric intensive signal processing algorithms while the general purpose processor manages overall control flow. The two processors communicate and transfer data for signal processing via shared memory. A direct memory access (DMA) controller is often associated with a processor in order to take over the burden of transferring blocks of data from one memory or peripheral resource to another and to thereby improve the performance of the processor.
Particular and preferred aspects of the invention are set out in the accompanying independent and dependent claims. In accordance with a first aspect of the invention, there is provided a digital system having at least one processor, with an associated multi-segment cache memory circuit. Within the cache, a data array is arranged as a plurality of lines each having one or more segments. Each of the segments has a corresponding valid bit within the set of valid bits, each valid bit is operable to indicate validity of the corresponding segment. Block circuitry is connected to the set of valid bits, the block circuitry is operable to invalidate a selected range of lines in response to a directive from the first processor. The block circuitry has a start register and an end register each separately loadable by the processor. The start register is operable to select a beginning line of the range of lines and the end register is operable to select an ending line of the range of lines.
In an embodiment of the invention, the block circuitry can invalidate either a single line or a block of lines in response to an operation command from the processor, depending on whether the end register is loaded or not.
In an embodiment of the invention, a set of dirty bits is provided. Each of the segments has a corresponding dirty bit within the set of dirty bits that is operable to indicate dirty data within the corresponding segment. The block circuitry is operable to clean a single line or a selected range of lines in response to a directive from the first processor.
Another embodiment of the invention is a method of operating a digital system having a processor and a memory cache. The processor executes instructions and causes transaction requests to the cache. Data and/or instructions are loaded into requested locations within the cache in response to the transaction requests. Valid bits are used to indicate within the cache that each requested location holds valid data. A program executing on the processor can select a range of locations within the cache and direct that an operation be performed on the range of locations within the cache. The operation can be a flush, a clean, or a clean and flush, for example.
Particular embodiments in accordance with the invention will now be described, by way of example only, and with reference to the accompanying drawings in which like reference signs are used to denote like parts and in which the Figures relate to the digital system of FIG. 1 and in which:
FIG. 1 is a block diagram of a digital system that includes an embodiment of the present invention in a megacell core having multiple processor cores;
FIGS. 2A and 2B together is a more detailed block diagram of the megacell core of FIG. 1;
FIG. 3 is a block diagram illustrating a shared translation lookaside buffer (TLB) and several associated micro-TLBs (μTLB) included in the megacell of FIG. 2;
FIG. 4 is a block diagram illustrating a configurable cache that is included in the megacell of FIG. 1 that has a cache and a RAM-set;
FIG. 5 is a flow chart illustrating operation of the hit/miss logic of the configurable cache of FIG. 4;
FIG. 6 is an illustration of loading a single line into the RAM-set of FIG. 4;
FIG. 7 is an illustration of loading a block of lines into the RAM-set of FIG. 4;
FIG. 8 is an illustration of interrupting a block load of the RAM-set according to FIG. 7 in order to load a single line within the block;
FIG. 9 is a flow diagram illustrating an interruptible block operation on the memory circuitry of FIG. 4,
FIG. 10 is a block diagram of the cache of FIG. 7 illustrating data flow for interruptible block prefetch and clean functions in the RAM-set portion;
FIG. 11 illustrates operation of the cache of FIG. 4 in which a block of lines is cleaned or flushed in the set associative portion;
FIG. 12 is a flow diagram illustrating cleaning of a line or block of lines of the cache of FIG. 4;
FIG. 13 is a block diagram of an embodiment of the cache of FIG. 7 illustrating a source/destination register for DMA operation; and
FIG. 14 is a representation of a telecommunications device incorporating an embodiment of the present invention.
Corresponding numerals and symbols in the different figures and tables refer to corresponding parts unless otherwise indicated.
Although the invention finds particular application to Digital Signal Processors (DSPs), implemented, for example, in an Application Specific Integrated Circuit (ASIC), it also finds application to other forms of processors. An ASIC may contain one or more megacells which each include custom designed functional circuits combined with pre-designed functional circuits provided by a design library.
FIG. 1 is a block diagram of a digital system that includes an embodiment of the present invention in a megacell core 100 having multiple processor cores. In the interest of clarity, FIG. 1 only shows those portions of megacell 100 that are relevant to an understanding of an embodiment of the present invention. Details of general construction for DSPs are well known, and may be found readily elsewhere. For example, U.S. Pat. No. 5,072,418 issued to Frederick Boutaud, et al, describes a DSP in detail. U.S. Pat. No. 5,329,471 issued to Gary Swoboda, et al, describes in detail how to test and emulate a DSP. Details of portions of megacell 100 relevant to an embodiment of the present invention are explained in sufficient detail herein below, so as to enable one of ordinary skill in the microprocessor art to make and use the invention.
Referring again to FIG. 1, megacell 100 includes a control processor (MPU) 102 with a 32-bit core 103 and a digital signal processor (DSP) 104 with a DSP core 105 that share a block of memory 113 and a cache 114, that are referred to as a level two (L2) memory subsystem 112. A traffic control block 110 receives transfer requests from a memory access node in a host processor 120, requests from control processor 102, and transfer requests from a memory access node in DSP 104. The traffic control block interleaves these requests and presents them to the shared memory and cache. Shared peripherals 116 are also accessed via the traffic control block. A direct memory access controller 106 can transfer data between an external source such as off-chip memory 132 or on-chip memory 134 and the shared memory. Various application specific processors or hardware accelerators 108 can also be included within the megacell as required for various applications and interact with the DSP and MPU via the traffic control block.
External to the megacell, a level three (L3) control block 130 is connected to receive memory requests from internal traffic control block 110 in response to explicit requests from the DSP or MPU, or from misses in shared cache 114. Off chip external memory 132 and/or on-chip memory 134 is connected to system traffic controller 130; these are referred to as L3 memory subsystems. A frame buffer 136 and a display device 138 are connected to the system traffic controller to receive data for displaying graphical images. Host processor 120 interacts with the resources on the megacell via system traffic controller 130. A host interface connected to traffic controller 130 allows access by host 120 to megacell 100 internal and external memories. A set of private peripherals 140 are connected to the DSP, while another set of private peripherals 142 are connected to the MPU.
FIG. 2, comprised of FIG. 2A FIG. 2B together, is a more detailed block diagram of the megacell core of FIG. 1. DSP 104 includes a configurable cache 203 that is configured as a local memory 200 and data cache 202, and a configurable cache 204 that is configured as instruction cache 206 and a RAM-set 208, which are referred to as level one (L1) memory subsystems. The DSP is connected to the traffic controller via an L2 interface 210 that also includes a translation look-aside buffer (TLB) 212. A DMA circuit 214 is also included within the DSP. Individual micro TLBs (μTLB) 216-218 are associated with the DMA circuit, data cache and instruction cache, respectively.
Similarly, MPU 102 includes a configurable cache 223 that is configured as a local memory 220 and data cache 222, and a configurable cache 224 that is configured as instruction cache 226 and a RAM-set 228, again referred to as L1 memory subsystems. The MPU is connected to traffic controller 110 via an L2 interface 230 that also includes a TLB 232. A DMA circuit 234 is also included within the MPU. Individual micro TLBs (μTLB) 236-238 are associated with the DMA circuit, data cache and instruction cache, respectively.
L2 traffic controller 110 includes a TLB 240 and a micro-TLB (μTLB) 242 that is associated with system DMA block 106. Similarly, L3 traffic controller 130 includes a μTLB controllably connected to TLB 232 that is associated with system host 120. This μTLB is likewise controlled by one of the megacell 100 processors.
Memory Management Unit
At the megacell traffic controller level, all addresses are physical. They have been translated from virtual to physical at the processor sub-system level by a memory management unit (MMU) associated with each core, such as DSP core 105 and MPU core 103. At the processor level, access permission, supplied through MMU page descriptors, is also checked, while at the megacell level protection between processors is enforced by others means, which will be described in more detail later.
The TLB caches contain entries for virtual-to-physical address translation and access permission checking. If the TLB contains a translated entry for the virtual address, the access control logic determines whether the access is permitted. If access is permitted, the MMU generates the appropriate physical address corresponding to the virtual address. If access is not permitted, the MMU sends an abort signal via signal group 244 to MPU 102.
Upon a TLB miss, i.e., the TLB does not contain an entry corresponding to the virtual address requested, translation table walk software retrieves the translation and access permission information from a translation table in physical memory. Once retrieved, the page or section descriptor is stored into the TLB at a selected victim location. Because a "load and store multiple" instruction may potentially cross a page boundary, the permission access is checked for each sequential address.
Unpredictable behavior will occur if two TLB entries correspond to overlapping areas of memory in the virtual space. This can occur if the TLB is not flushed after the memory is re-mapped with different-sized pages leaving an old mapping with different sizes in the TLB, and making a new mapping that gets loaded into a different TLB location, for example.
MMU/TLB Control Operation
FIG. 3 is a block diagram illustrating a shared translation look-aside buffer (TLB) 300 and several associated micro-TLBs (μTLB) 310(0)-310(n) included in megacell 100 of FIG. 2. On a μTLB miss, the shared TLB is first searched. TLB controller 320 is alerted by asserting a μTLB miss signal 324. In case of a hit on the shared TLB, the μTLB that missed is loaded with the entry content of the shared TLB 300. In case of miss in shared TLB 300, the shared TLB alerts TLB controller 320 by asserting a TLB miss signal 326. Controller 320 then asserts an interrupt request signal 328 to system interrupt controller 250. Interrupt controller 250 asserts an interrupt to the processor whose OS supervises the resource which caused the miss. A TLB entry register 330 associated with TLB controller 320 is loaded by a software TLB handler in response to the interrupt. Once loaded, the contents of TLB entry register 330 are transferred to both shared TLB 300 and the requesting μTLB at a selected victim location as indicated by arcs 332 and 334.
Shared Cache and RAM
Referring again to FIG. 1, Megacell 100 includes large shared memory subsystem 112 that function as a secondary level of RAM (L2 RAM) 113 and cache (L2 Cache) 114. This level of memory is preferably called the outer level, as each processor in various embodiments may have multilevel internal memory. However, for the present embodiment, processors 102, 104 have one level of internal memory, which is referred to herein as L1 within the memory hierarchy, therefore the outer level memory subsystem will be referred to as level two (L2). The megacell outer memory 112 is organized as what's called a SmartCache, which is a configurable cache and which allows concurrent accesses on cache and RAM-set. RAM-set is a block of RAM that has aspects of cache behavior and cache control operations as well as DMA capability. The SmartCache architecture provides predictable behavior and enhanced real-time performance while keeping high flexibility and ease of use. A detailed description of a SmartCache is provided in U.S. patent application Ser. No. 09/591,537, (TI-29884) entitled Smart Cache. Advantageously, RAM-set configured as a RAM offers fast memory scratchpad feature.
Megacell "outer" memory 112 can be shared between megacell internal processors and external Host processors or peripherals. RAM usage can also be restricted to the usage of a single processor thanks to the MMU mechanism, described earlier. However, in another embodiment a need might arise in the megacell to add additional physical protection per processor on some part of megacell memory to overwrite the MMU intrinsic protection.
A unified shared cache architecture of this embodiment is a four way set associative cache with segmented lines to reduce system latency. All outer memories are treated as unified instruction/data memory to avoid compiler restrictions such as data in program space or vice-versa. Size of this cache or the degree of associativity is a design choice and may vary in other embodiments of the present invention. General construction of set-associative caches are known and need not be described in detail herein. Typically, L1 caches are 16 kbytes or 32 kbytes, and the L2 cache is 128 kbytes, 256 kbytes or larger, for example. Likewise, the number of associated RAM-sets may vary in other embodiments.
RAM-set control registers, such as control register 531 in cache control circuitry 530 (FIG. 4), are memory mapped and therefore also benefit from the protection provided by the MMU. However, this would force operations on cache or any specific RAM-set to be on separate pages for protection reasons. Therefore, a control register is provided in TLB control register set 323 (FIG. 3) to configure how and by which CPU the various parts of megacell memory are controlled. All CPUs can execute operations such as cache flushing or cache cleaning as these operations will be restricted by a resource identifier field located in the TAG area of the cache.
FIG. 4 is a block diagram illustrating a representative configurable cache 500 that has a cache representative of L2 cache 114 and a RAM-set representative of shared RAM 113. Configurable cache 500 is also representative of L1 cache 203, 204, 223, and 224 that are included respectively in each of the processor modules 102, 104 of FIG. 2; however, in the present embodiment, each L1 cache has only a single segment per line. As discussed above, the configurable cache is composed of a 4-way set-associative cache that includes a TAG Array 502(0-3) and Data array 506(2-5) and one or more additional RAM-sets, in this case data arrays 506(0-1). In the present embodiment, data array 506(1-5) are each 32 kbytes, while data array 506(0) is 64 kbytes.
During an access request, each TAG array 502(0-3) provides a tag value to a respective comparator 546(0-3) and is compared against a most A significant portion of a proffered address 548. A tag value is stored in tag array 502(0-3) according to an index value that corresponds to a least significant address of a proffered address. Thus, for any proffered address, an associated tag may be found on anyone of the four tag arrays. If a tag matches a proffered address, then hit/miss logic 510 asserts a respective hit signal hit-way(2-5) 514. In this embodiment, a resource ID (R-ID) field 520 and a task ID (task-ID) field 522 is also included with each entry in the tag array, along with a set of valid bits VI(1-4). Usage of these fields will be described in more detail later. Prefetch circuitry 516 receives signals 512-514 and forms a request to L3 memory when a miss occurs. For each hit, the requested data is provided via bus 541 b to an output port of the cache via cache output buffer 540 b. In certain embodiments, an L1 cache may have task_ID and R-ID fields, while in other L1 cache embodiments these fields may be omitted.
The RAM-set also includes valid bit arrays 504(0-1) The RAM-set can be configured as a cache extension or as a block of RAM. When configured as RAM, a loading mechanism is provided by a separate DMA engine to optimize data transfer required by multimedia applications. For each hit in the RAM-set portion of the cache, requested data is provided via bus 541 a a second output port of the cache via cache output buffer 540 a.
Cache control circuitry 530 includes control registers 531 which are used to configure the configurable cache. Fields in the control register include: RAM_fill_mode, Cache_enable, organization, and Full_RAM_base. The control circuitry is coupled to all of the operational blocks of the configurable cache and allows for dynamic reconfiguration of the configurable cache under control of software.
In the embodiment of FIG. 4, the RAM-set has two different sized data arrays, Data array 506(0) is 64 kbytes and Data array 506(1) is 32 kbytes; however, other embodiments may specify all RAM-sets with the same size to simplify the hardware logic and the software model.
Each RAM-set has an associated TAG register, referred to as Full Set Tag 508(0-1) containing the base address of the RAM-set and a global valid bit (VG) 509(0-1) in addition to an individual valid bit contained in valid bit arrays 504(0-1), referred to as VI, for each segment of each segmented line in the associated data array. Each segment has also a dirty bit referred to as DI, not shown on this figure but on a later one. In the present embodiment, RAM-set lines have the same size as the cache lines; however, in other embodiments a longer line size can also be used to reduce the number of VI bits. RAM-set base registers are coupled with a logical comparison 542(0-1) on a most significant address portion 544 for each access request.
An organization field in cache control register (RAMset-ctrl[n]) 531 for each RAM-set provides the capability to configure it as a cache extension (RAM-set) or as a plain RAM. When configured as a plain RAM, the valid bits are ignored. Table 1 explains other fields in this register.
Cache Control Register
0/1 RAM-set 0 operates as a cache or as a RAM
0/1 RAM-set 1 operates as a cache or as a RAM
DMA mode bit
When set, block operations operate in DMA mode
Fill Mode
Line by line fill, or complete block fill
For L2 caches, there is another control word that indicates which CPU can configure the RAM-set behavior of each L2 RAM-set. This control word is memory mapped and accessible only to the MPU master. For example: Bit[0]:0/1 CPU master/DSP master for RAM set 0.
A status register (not shown) connected to cache control circuitry 530 provides cache information, including number of RAM-sets, sizes, Cache number of way, and line size.
When configured as a RAM, base address registers 508(0-1) are programmed such that this memory does not overlap with other memories in the system. Note, the base address register and the full set tag register are the same. This memory space is mapped as non-cacheable at the outer level. RAM control logic (address decode) generates a hit equivalent signal, which prevents the outer cache from fetching the missing data/instruction to the external memory. VG bit 509(0-1) acts as an enable/disable. It is set when the base address register is written to and cleared when the RAM is invalidated or disabled.
If the register base address of the RAM is programmed in such a way that the associated memory area overlays with the external memory, coherency is not guaranteed by hardware of this embodiment.
When configured as a cache, hit/miss control circuitry 510 generates hit/miss signals called hit-hit 512 and hit-miss 513 for each RAM-set. A hit-hit is generated when a valid entry of the RAM-set matches the address provided by the core. An entry is valid when both VG and its VI are set. A hit-miss signal is generated when the base address of the RAM is valid (VG=1) and matches the most significant portion of an address provided by a processor but the selected entry in the RAM-set has its VI equal to zero.
The hit-miss or hit-hit signal has precedence over the hit way (2-5) signals 524 of the 4-way set-associative cache. This implies that any value loaded previously in the cache that should be in the RAM-set is never selected and will eventually be removed from the cache. However, data can create coherency problem in case of modified data (copy back). Therefore, it is recommended to write back ("clean") or even flush the range of address that will correspond to the RAM-set range of addresses. Other embodiments might not have such precedence defined and instead rely on cache invalidate operations to correctly prepare an address range that will be programmed to reside in a RAM-set, for example.
FIG. 5 is a flow chart illustrating operation of the hit/miss logic of the configurable cache of FIG. 4. In step 550, an address is received from the processor core in connection with a read operation. If the instruction/data cache is disabled, which is checked in step 552, the instruction/data is retrieved from second level memory in step 554. If the cache is enabled, then if either the high order bits of the address from the processor (ADDR[H]) do not match the high order bits of the starting address 508(n) or the global valid bit 509(n) is set to "0" (step 556), then there is a RAM-set miss. In this case, if there is a cache hit in the 4-way set associative cache in step 558, then the information is retrieved from the 4-way set associative cache is presented to the core processor via cache output buffer 540 b. If there is a miss in the 4-way set associative cache, the line is loaded into the 4-way cache from second level memory.
Returning again to step 556, if both the high order bits of the address from the processor (ADDR[H]) match the high order bits of the starting address 508(n) and the global valid bit 509(n) is set to "1", then there is a RAM-set hit at the line corresponding to ADDR[L], and the valid entry bits are used to determine whether it is a hit-hit situation where the requested instruction is present in the RAM-set and can be presented to the processor, or a hit-miss situation where the requested instruction is mapped to the RAM-set, but the information needs to be loaded into the RAM-set's data array 506(n) from the second level memory. If, in step 564, the individual valid entry bit (VI) 504(n) for the line indicates that the line is valid (VI[ADDR[L]]=1), the instruction is present in the RAM-set and is presented to the processor through the RAM-set's output buffer 540 a. If, on the other hand, the valid entry bit for the line indicates that the line is not valid (VI[ADDR[L]]=0), the line is loaded into the data array 506(n) of the RAM-set from main memory in step 568.
FIG. 6 is an illustration of loading a single line into the RAM-set of FIG. 4, in which only one data array 506(0) and its associated bases address register 508(0), global valid bit 509(0) and individual valid bit array 504(0) are illustrated. The RAM-set can be loaded in two ways: Line-by-line fill, and Complete fill/block fill, as indicated by the RAM_fill_mode field of control register 531.
When a new value is written into full-set TAG register (base address) 508(0), all content of the RAM-set data array associated with that TAG register is invalidated by setting individual valid bits 504(0) to logical 0; however, global valid bit 509(0) is set to logical 1. Following the programming of the base address register, the RAM-set will begin to fill itself one line at a time on every hit-miss located in the RAM-set, as discussed with reference to FIG. 5. For example, after a miss at an address location corresponding to line 611, data is accessed from second level memory and placed in line 611, VI bit 610 is set to logical 1, and the requested data is provided to the processor.
On the other hand, if a set fill (RAM_fill_mode) is chosen, when the starting address is written to the Full_set_tag register 508(0), all or a portion of the associated data array 506(0) is filled through a block fill process. As each line is loaded from second level memory, the individual valid entry bit 504(0) corresponding to the line is set to "1".
FIG. 7 is an illustration of loading a block of lines into the RAM-set of FIG. 4. The block fill is based on two additional registers called Start (CNT) 700 and End 702. Start is a 32-n-bit counter and End is a 32-n-bit register, where 2n represent the number of byte per line. An array area 710 to be filled is defined by an initial value of Start 700 a, indicated at 711, and the value of End 702, indicated at 712, for example. In this embodiment, a single block operation can span one or more RAM-set, for example.
Writing a value in End register 702 sets the RAM-set control 530 in block fill mode for the block loading. Setting Start 700 after setting End 702 initiates a block transfer. At this time, all of the individual valid bits associated with array area 710 are set to logical 0. Setting Start address 700 without previously setting the end address or writing the same value in start and end simply loads the corresponding entry. A finite state machine (FSM) represented by flip-flop 720 controls the block fill. FSM 720 is part of control circuitry 530.
Asserting signal 721 causes load signal LD to be asserted to load Start register 700 and initiates the block fill. Signal LD is asserted in response to signal 721 if state machine 720 isn't already performing a block load from a prior command. Signal 721 is asserted in response to specific load operation command or a miss on load, which will be described later. As each line is loaded into array area 710, a corresponding individual valid bit is set to logical 1, such as bit 713, for example. Signal 722 is asserted when counter 700 has been incremented to equal the value in End 702. Signal 723 drives status bit 31 of a SmartCache status register to indicate when a block fill is in operation.
If state machine 720 is already performing a block load, a second one stops the current block load transfer. The system relies on the CPU to check that no active block load operation is on-going if the first prefetch must complete before another is initiated. Another embodiment could signal an error to the CPU or stall the CPU until completion of the current block load. However, the last embodiment is not suitable for real time system as the stall period becomes highly dependent on the block load size operation.
In the case of multiple RAM-sets, the start address determines in which RAM-set the block load is directed. The selection of the RAM-set is done by comparing the top part of the start address with the contents of the RAM-set base address and loading the bottom part in the counter (CNT). If the start address is not included inside any of the RAM-set, the instruction behaves like a prefetch block or respectively as a prefetch-line on the cache. Depending on the End and Start values, the block size can vary from one line to n lines.
As discussed earlier, the RAM-set of the Configurable cache can be managed in chunks of contiguous memory. Standard cache operations such as miss resulting from a CPU read access on the RAM-set prefetch I/D entry or clean entry are respectively changed into a block prefetch operation or a block cleaning operation if the end of block register 702 has been previously programmed. A block operation can also result from the programming end-of-block register 702 and start-of-block register 700. Clean operations are blocking, but interruptible on the completion of a line in order to guarantee maximum latency for real-time systems. An interrupt stops the block operation to let the CPU process the interrupt and the software then re-starts the block operation when the interrupt return occurs.
The block prefetch operation of the present embodiment re-use the existing hardware used for full cleaning of the cache; however another embodiment can have a different counter and state machine controller, for example. During the block operation the CPU can be in wait and its activity is resumed on reception of an interruption which stops the current block operation or the CPU can be concurrently running with a single cycle stall during line transfer in the write/read buffer. In this embodiment, block operations resulting from a miss are generally blocking, while block operations resulting from a prefetch command run concurrently.
FIG. 8 is an illustration of interrupting a block load of the RAM-set according to FIG. 7 in order to load a single line within the block. To reduce system latency, a megacell processor, referred to generically as a CPU, advantageously can still access both cache and RAM-set when block loading is in progress; therefore, the following can happen:
(1) The CPU accesses a line already loaded. The CPU is served immediately or after one cycle stall if there is a conflict with a line load.
(2) The CPU accesses a line not yet loaded, referred to as a hit-miss. The CPU is served after the completion of the on-going line load. For example, if an access is made to line 732 prior to being loaded by a pending block load, then VI bit 733 will be logical 0. This will cause the hit-miss signal associated with this RAM-set to be asserted. Line 732 will then be accessed and loaded into data array 730 and the CPU request is satisfied.
In order to take further advantage of the fact that a line within data array 730 has been fetched in response to a CPU access request, each line load is done in two indivisible steps. First, the entry's VI bit is checked by detection circuitry 510 in response to control circuitry 530 to determine if the entry has already been fetched. Then, only if the line is not already present in the cache or in the RAM-set, it is loaded from secondary memory.
Before initiating a block load by programming new values in End and Start, the status must be checked to see that no previous block load is on-going. In this embodiment, there is no automatic hardware CPU stall on this case and doing so would cause the on-going block load to stop. This could result in an unexpected long latency in a real-time applications for accesses into the RAM-set in which the block load was interrupted in this manner. However, in another embodiment, means are provided to allow a second prefetch block command to stop a current active one. Once the second block command is completed, the first one is resumed.
Thus, the present embodiment provides an interruptible prefetch/save block on RAM-set using current cache mechanism: miss on load and prefetch D-line/prefetch I-line respectively for data/instruction after programming the end-of-block register, the CPU being in wait during block operation. Similarly, the present embodiment provides an interruptible clean block operation on RAM set using current cache mechanism clean-entry after programming the end-of-block register, the CPU being in wait during block operation. For prefetch block, the preferred embodiment is a non blocking operation on the current embodiment.
The present embodiment provides the ability to prefetch block on RAM-set using the cache mechanism: prefetch D-line/prefetch I-line respectively for data/instruction after programming the end-of-block register with concurrent CPU cache and/or RAM-set access.
The present embodiment performs both of the above using an end-of block register and a start-of block register to initiate block operation (initial value of the block counter).
The present embodiment also extends the Interruptible Prefetch/save block scheme to the cache with no boundary limit between cache and RAM-set. This is the same as cache operation based on range of addresses.
Cache Features
The unified cache memory of the present embodiment supports write back, and write through with/without write-allocate on a page basis. These controls are part of the MMU attributes. Hit under miss is supported to reduce conflicts between requesters and consequent latency. Concurrent accesses on RAM-sets and cache are supported.
Referring again to FIG. 4, on a cache miss, the segment corresponding to the miss is fetched from external memory first. For this discussion, data array 506(0) will be discussed, although it is actually configured as a RAM-set instead of Cache. All of the data arrays 506(0-5) have the same organization. Each data array has a number of lines, line 507 being representative, which are segmented into four segments 507(0-3) that each hold 16 bytes data or instruction. For example, in L1 cache 224 if a miss occurs in second segment 507(1), the second segment is fetched from second level RAM 113 or cache 114 or from third level memory 132, 134 if the second level misses. Then, the third segment and finally the fourth segment are loaded into segments 507(2) and 507(3) automatically, referred to as automatic hardware prefetch. In this embodiment, first segment 507(0) is not loaded into the cache. This sequence of loads can be interrupted on a segment boundary by a miss caused by a request having higher priority. The interrupted load is not resumed, as the remaining segments will be loaded if required later in response to a new miss.
Likewise, second level cache 114 has a data array with a number of lines that are segmented into four segments that each hold 16 bytes. If second level cache 114 misses, it will be filled from third level memory 132, 134 using a multi-cycle operation in which each segment of a given line is accessed. Multi-cycle operations on second level cache 114 are non-blocking. A Multi-cycle cache operation is launched and a status bit indicates its completion. As operations can be initiated by several requesters, such as DSP 104 and MPU 102, these operations can not be blocking due to real time constraints. If one processor initiates a clean_all_task_ID or a block operation for example, other requests can interleave.
Each cache segment has a valid bit (VI) and a dirty bit (not shown) in tag array 502(0-3). Each line such as 507 also has an associated shared bit (not shown) in the tag array. On a write back when a line is replaced, only the segments with modified (dirty) data are written back. Each RAM-set segment has a valid bit (VI) in tag array 504(0-1).
In this embodiment, RAM-sets do not have Task_ID and R-ID fields and shared bit markers associated with each line. Operations on task_ID, R-ID, data marked as shared are limited to the cache. However, another embodiment may harmonize the RAM-set and cache. The hit logic of second level cache 114 only uses the address field. Task-Id and R-Id are used in task operations only.
In this embodiment, L1 caches 202, 206, 222, 226 and L2 cache 114 are organized as 4-way set associative caches. A random cache replacement strategy has been chosen for the replacement algorithm of the 4-way set associative caches. In this embodiment, the caches do not support cache entry locking except through the RAM-set.
Table 2 includes a listing of the various cache and RAM control operations that can be invoked by the processors in the megacell of the present embodiment. In this embodiment, all operations on an entry operate on segments; there are four segments per entry in the L2 cache, as discussed above. When applied to L1 caches which are segregated into a data cache and a separate instruction cache, then the flush, clean and prefetch operations are directed to the type of information contained in the targeted cache. This means that a way is provided to identify on which cache, instruction or data, a command such as flush applies.
A state machine in cache controller circuitry 530 executes a requested control operation, as indicated by a control word.
In another embodiment, the control operations can be invoked by executing an instruction that invokes a hardware or software trap response. As part of this trap response, a sequence of instructions can be executed or a control word can be written to selected address, for example. In another embodiment, one of the processors may include instruction decoding and an internal state machine(s) to perform a TLB or Cache control operation in response to executing certain instructions which may include parameters to specify the requested operation.
Cache and RAM Control Operations
(C: operation on the cache, RS: operation on RAM-set, R: operation on RAM)
Software view (memory mapped/co-proc)
Flush_entry (address)
Flush the entry1, whose address matches the provided address or a Range of
addresses, if End has been set previously. Flush-range instruction is made of
two consecutive instructions Set_End_addr(address) + Flush_entry (address).
Flush all entries matching to the current taskID in the cache but not in the
Flush all entries matching to the current R_ID in the cache but not in the
Flush all entries in the cache but not in RAM-set
Flush all entries marked as shared
Flush all entries matching the current taskID and marked as shared
Flush all entries matching the current taskID and marked as not shared
shared (task_ID)
Clean_entry (address)
Clean the entry1, whose address matches the provided address or a Range of
address if End has been set previously. Clean-range instruction is made of two
consecutive instructions Set_End_addr(address) + Clean_entry (address).
Clean all entries matching to the current taskID in the cache but not in the
Clean all entries matching to the current R_ID in the cache but not in the
Clean all entries in the cache but not in RAM-set
Clean entries marked as shared
Flush all entries matching the current taskID and marked as shared
Clean all entries matching the current taskID and marked as not shared
Clean and flush the entry1, whose address matches the provided address or a
Range of address if End has been set previously. Clean-range instruction is
made of two consecutive instructions Set_End_addr(address) + Clean_entry
Clean and flush all entries matching to the current taskID in the cache but
entry_of_taskID (Task_ID)
not in the RAM-set
Clean and flush all entries matching to the current R_ID in the cache but not
of_R_ID (Task_ID)
in the RAM-set
Clean and flush all entries in the cache but not in RAM-set
Clean and flush entries marked as shared
Clean and flush all entries matching the current taskID and marked as shared
taskID_shared (task_ID)
Clean and flush all entries matching the current taskID and marked as not
not_shared (task_ID)
Set new RAM-set base address, set VG and clear all VI and set End to last
RAM-set address by default preparing the full RAM-set loading. In that case
no need to write the END address before writing the start address to load the
Set_End_Addr (address)
Set end address of the next block load and set the RAM-set controller in block
fill mode.
Set_start_addr (address)
Set start address of a block and initiates the loading of this block
Prefetch-the entry, whose address matches the provided address or a Range of
address if End has been set previously. Prefetch-range instruction is made of
two consecutive instructions Set_End_addr(address) + Prefetch_entry
Flush_RAM-set (RAMset_ID)
Clear VG and all VI of the selected RAM-set
Detailed Aspects
Various aspects of the digital system of FIG. 1 will now be described in more detail.
FIG. 9 is a flow diagram illustrating an interruptible block operation on the memory circuitry of FIG. 4. As discussed earlier (see Table 2—Cache and RAM Control Operations), a block operation can be performed to load, to clean, or to flush (invalidate) a portion of the cache or RAM-set. This discussion will describe a block load, but a block clean operates in a similar manner. In step 900, a block operation is initiated to load a selected portion of the segments in the cache or RAM-set, according to a value stored in end register 702 and in start register 700. The operation is initiated by writing an operation directive, as listed in Table 2, to control circuitry 530 along with a starting address that is loaded in start register 700. In this embodiment, all segments within the selected block of segments are automatically invalidated in response to initiating a block load operation. However, in another embodiment, segments may or may not be automatically invalidated.
In step 902, prior to loading a line, the valid bit (VI bit 504(0), see FIG. 7) associated with the line, or with the segment of the line if there are multiple segments per line, is tested to determine if the segment contains valid data. If the segment does not contain valid data, then a line or a segment is fetched in step 904 and the segment is then marked as being valid by setting a corresponding valid bit. On the other hand, if step 902 determines that a segment contains valid data from a prior data transfer operation, then step 904 is inhibited and a transfer to the valid segment is not performed, as illustrated by link 903. Advantageously, performance is improved by inhibiting transfers to segments that already have valid data.
In step 906, a test of end register 702 is made to determine if the end of the block has been reached. If so, the block operation is completed at step 910. If the end of the block has not been reached, then the next address is selected in step 908 and steps 902, 904 and 906 are repeated.
In this embodiment of the present invention a processor connected to the memory circuit can continue to execute instructions during a block operation either because it runs concurrently, or because an interrupt occurs. In so doing, it may access an address during step 920 that is within a block that is being loaded as a block operation, as discussed with respect to FIG. 8.
In step 922 miss circuitry checks a valid bit associated with the segment that is accessed by the processor in step 920 to determine if the segment contains valid a instruction or data value. If the CPU accesses a line already loaded, the CPU is served immediately or after one cycle stall (conflict with a line load), as indicated by arc 923.
If the CPU accesses a line not yet loaded (hit-miss), then the CPU is served after the completion of an on-going block line load. For example, if an access is made to line 732 prior to being loaded by a pending block load, then VI bit 733 will be logical 0. This will cause the hit-miss signal associated with this RAM-set to be asserted in step 922. Line 732 will then be accessed and loaded into data array 730 in step 926 and the CPU request is satisfied. During step 926, the valid bit for the segment just fetched is asserted, so that a later access attempt by the block loading circuitry will be inhibited, as discussed in step 902.
In step 924, this embodiment of the invention performs a test after a miss is detected in step 922. If end register 702 has been loaded with an end-of-block address and a block transfer is not currently underway, as indicated by status signal 723 from FSM 720, then a block operation is commenced, as indicated by arc 925. In this case, the block operation starts at an address provided by the miss detection circuitry associated with the miss detected in step 922. The block operation ends at the address provided by the end register.
Another embodiment of the present invention may not provide the feature illustrated by step 924. Other combinations of the various features illustrated in FIG. 9 may be provided in other embodiments of the invention. For example, another embodiment of the invention may provide block initiation by step 924, but not provide an operation initiation step 900.
FIG. 10 is a block diagram of a level one (L1) cache according to FIG. 7, illustrating data flow for interruptible block prefetch and clean functions. As discussed earlier, each segment has an associated individual valid bit (VI) and an individual dirty bit (DI). The VI bit indicates the associated segment contains valid data. Valid data is placed in a segment in response to a fetch after a miss, or a preemptive block load. In some embodiments of the invention, a DMA transfer can also place valid data in a segment. The DI bit indicates the data in the associated segment is "dirty," meaning it has been changed in some manner that is not reflected in the secondary memory location from which it was originally fetched. Generally, this is due to a write transaction by the CPU 1800. In another embodiment of the invention, a DMA transaction can place dirty data into the cache. In this embodiment, there are four segments per line, therefore there are four valid bits and four dirty bits per line. During a clean operation, a dirty line is first held in write buffer 1504 pending transfer to external memory 1502. Memory 1502 is representative of external memory 132 or on chip external memory 134 (FIG. 1). During a block load operation, a data line is transferred from external memory 1502 to data array 710 under control of FSM 720, as described earlier.
FIG. 11 illustrates operation of the cache of FIG. 4 in which a block of lines is cleaned or flushed. Programming register "end of block" 702 changes a cache operation such as clean or flush for a single specified entry to an operation on a block of lines located between this specified entry and the entry pointed by "end of block" register 702. The function can also be implemented using "end-of block" register 702 and start-of block register 700 to hold an initial value of the block counter. Finite state machine 720 controls the cache block flush and clean operations, as described previously with respect to FIG. 7 and FIG. 8 for cleaning and flushing the RAM-set. In the present embodiment, the same FSM and address registers are used to control cache cleaning and RAM-set cleaning operations.
Thus, a cache clean and/or a cache flush operation can be performed on a range of addresses in response to a software directive.
In another embodiment, separate control circuitry can be provided for the cache and for the RAM-set. Alternatively, in another embodiment a RAM-set may not be included.
FIG. 12 is a flow diagram illustrating cleaning of a line or block of lines of the cache of FIG. 4, according to an aspect of the present invention. As discussed earlier (see Table 2—Cache and RAM Control Operations), a block operation can be performed to load or to clean a portion of the cache or RAM-set. This discussion will describe a block clean operation, but a flush can be performed in a similar manner. In step 1200, an operation is initiated to clean a selected portion of the segments in the cache or RAM-set, according to a value stored in end register 702 and in start register 700. The operation is initiated by writing an operation directive, as listed in Table 2, to control circuitry 530 along with a starting address that is loaded in start register 700. However, if a block operation is to be performed instead of a single line operation, then an ending address value is written into end register 702 prior to loading the start register.
In step 1202, this embodiment of the invention performs a test after an operation is initiated in step 1200. If end register 702 has not been loaded with an end of block address, then step 1204 checks a dirty bit associated with the address selected by start address register. As mentioned earlier, this embodiment has four dirty bits for each line. The start register and end register contain addresses that are line aligned, so all four dirty bits on each line are checked. If the dirty bit indicates the associated line contains dirty data, then the segments which have dirty data are written to secondary memory in step 1206. If the line does not contain dirty data, then the operation is completed as indicated in step 1210.
Another embodiment of the present invention may omit the feature illustrated by step 1202 and instead only provide block operations, where a block operation may cover only a single line if start=end, for example.
Referring back to step 1202, if end register 702 has been loaded with an end-of-block address and a block transfer is not currently underway, as indicated by status signal 723 from FSM 720, then a block operation is commenced, as indicated by arc 1203. In this case, the block operation starts at an address provided by start address register 700. The block operation ends at the address provided by the end register.
In step 1214 a check is made of a dirty bit associated with the address selected by start address register, a described for step 1204. If the dirty bit(s) indicates the associated line contains dirty data, then that line or segments are written to secondary memory in step 1216. If the line does not contain dirty data, then a write transaction is not required.
In step 1218, a test of end register 702 is made to determine if the end of the block has been reached. If so, the block operation is completed at step 1210. If the end of the block has not been reached, then the next address is selected in step 1220 by incrementing the start register and steps 1214, 1216, and 1218 are repeated.
In this embodiment of the present invention a processor connected to the memory circuit can continue to execute instructions during a block operation. In so doing, it may access an address that is within a block that is being cleaned as a block operation, as discussed with respect to FIG. 8. During the block operation the CPU can be in wait and its activity is resumed on reception of an interruption which stops the current block operation or the CPU can be concurrently running with a single cycle stall during line transfer in the write/read buffer. In the case of an interrupt, an interrupted block operation is resumed after the interrupt is serviced.
A flush operation is performed in a similar manner. A flush simply invalidates each valid bit within the range selected by the start register and the end register. Essentially the same flow is used. In steps 1204 and 1214, the selected valid bit(s) are cleared regardless of the state of the associated dirty bits. Dirty bits are not checked and steps 1206, 1216 become irrelevant, since the state of the dirty bits doesn't matter during a flush and no data is written to secondary memory.
A clean and flush operation is also performed using the same flow. In this case. in steps 1204 and 1214, the selected valid bit(s) are cleared and the selected dirty bit(s) are checked. If a valid bit is in a valid state, it is also reset to an invalid state in steps 1204, 1214. If a dirty bit was asserted, the associated segment is written to secondary memory in step 1206, 1216.
FIG. 13 is a block diagram of an embodiment of the cache of FIG. 7 illustrating an aspect of the present invention. A source/destination register 1610 is provided for direct memory access (DMA) operation. The RAM-set of the Configurable cache can be configured as a local memory with DMA support or as a cache with DMA support, according to mode bit 1 of control register 531. DMA control circuitry is provided by cache hardware logic including FSM 720, start register 700 and end register 702. The Configurable cache commands (Table 2) are indifferently used in both modes. Multiplexor 1612 is controlled by mode signal 1614 to select dest/src register 1610 for providing addresses to external memory 1602 when in DMA mode. Source/destination register 1610 provides a destination/source address that enables re-allocation of data or instructions from an address space associated with data array 1606 to a different address space during transfer from/to external memory 1602. Likewise, multiplexor 1612 is controlled by mode signal 1614 to select cache address signals 1618 which are a concatenation of base-address register 508 and counter 700 for providing addresses to external memory 1602 when in RAM-set mode. In RAM-set mode, data array 1606 represents an address space for local storage of data or instructions from a same address space in external memory 1602. Mode signal 1614 is provided by a control register in control circuitry 530 (see FIG. 5) that is controlled by software. Software can change the mode from DMA operation to non-DMA operation as needed. Other embodiments may use a different means for invoking DMA operation, such as by keeping track of when src/dest register 1610 is loaded, or by using separate operation commands, for example.
Thus, identical control for local memory working as a cache (RAM-set) or as a local memory with DMA is provided. In an alternative embodiment, separate DMA control logic may be provided instead of reusing cache control FSM 720, for example.
In this embodiment, the VI bits are not affected by DMA transfers. In another embodiment, DMA transfers cause the associated VI bits to be asserted. In yet another embodiment, an additional DMA-cache mode bit is provided in control register 531. When set to a DMA-cache mode, each DMA transfer of data into data array 1606 causes the associated VI bit to be asserted. When not in DMA-cache mode, the associated VI are not asserted by a DMA transfer. In another embodiment, a DMA transfer sets the dirty bits associated with a transfer to the cache. Likewise, a DMA transfer may perform a cleaning operation by only transferring data from a cache that is marked as being dirty.
Advantageously, when the associated valid bits 1620 of the RAM-set are asserted in response to a DMA transfer, then they can be used to monitor the DMA progress, as discussed with respect to FIG. 7 and 8. This allows CPU 1600 to have access to the RAM-set concurrently with the DMA operation, including within the range of addresses that are being transferred by the DMA operation.
Digital System Embodiment
FIG. 14 illustrates an exemplary implementation of an example of such an integrated circuit in a mobile telecommunications device, such as a mobile telephone with integrated keyboard 12 and display 14. As shown in FIG. 14, the digital system 10 with a megacell according to FIG. 2 is connected to the keyboard 12, where appropriate via a keyboard adapter (not shown), to the display 14, where appropriate via a display adapter (not shown) and to radio frequency (RF) circuitry 16. The RF circuitry 16 is connected to an aerial 18.
It is contemplated, of course, that many other types of communications systems and computer systems may also benefit from the present invention, particularly those relying on battery power. Examples of such other computer systems include personal digital assistants (PDAs) portable computers, smart phones, web phones, and the like. As power dissipation is also of concern in desktop and line-powered computer systems and micro-controller application, particularly from a reliability standpoint, it is also contemplated that the present invention may also provide benefits to such line-powered systems.
Fabrication of the digital systems disclosed herein involves multiple steps of implanting various amounts of impurities into a semiconductor substrate and diffusing the impurities to selected depths within the substrate to form transistor devices. Masks are formed to control the placement of the impurities. Multiple layers of conductive material and insulative material are deposited and etched to interconnect the various devices. These steps are performed in a clean room environment.
A significant portion of the cost of producing the data processing device involves testing. While in wafer form, individual devices are biased to an operational state and probe tested for basic operational functionality. The wafer is then separated into individual dice which may be sold as bare die or packaged. After packaging, finished parts are biased into an operational state and tested for operational functionality.
The digital systems disclosed herein contain hardware extensions for advanced debugging features. These assist in the development of an application system. Since these capabilities are part of the megacell itself, they are available utilizing only a JTAG interface with extended operating mode extensions. They provide simple, inexpensive, and speed independent access to the core for sophisticated debugging and economical system development, without requiring the costly cabling and access to processor pins required by traditional emulator systems or intruding on system resources.
As used herein, the terms "applied," "connected," and "connection" mean electrically connected, including where additional elements may be in the electrical connection path. "Associated" means a controlling relationship, such as a memory resource that is controlled by an associated port. The terms assert, assertion, de-assert, de-assertion, negate and negation are used to avoid confusion when dealing with a mixture of active high and active low signals. Assert and assertion are used to indicate that a signal is rendered active, or logically true. De-assert, de-assertion, negate, and negation are used to indicate that a signal is rendered inactive, or logically false. References to storing or retrieving data in the cache refer to both data and/or to instructions.
While the invention has been described with reference to illustrative embodiments, this description is not intended to be construed in a limiting sense. Various other embodiments of the invention will be apparent to persons skilled in the art upon reference to this description. For example, in another embodiment, the cache memory may be a simple cache that does not include multi-set associativeity or configurable features while still providing DMA transfers. The cache may be positioned at a level other than L2. The cache may have a different set organization with a different number of segments per line, for example. Likewise, the start and end registers may contain addresses that are segment aligned rather than line aligned. References to data being stored in a cache segment are to be interpreted as meaning data or instructions, depending on a particular cache.
It is therefore contemplated that the appended claims will cover any such modifications of the embodiments as fall within the true scope and spirit of the invention.
|Cited Patent
|Filing date
|Publication date
|Dec 4, 1986
|Apr 4, 1989
|Sequoia Systems, Inc.
|Memory back up system with one cache memory and two physically separated main memories
|Jul 27, 1995
|Nov 25, 1997
|Nec Corporation
|Cache flash controlling method for cache memory system
|Dec 19, 1995
|Jul 7, 1998
|Advanced Micro Devices, Inc.
|System and apparatus for partially flushing cache memory
|Apr 19, 1996
|Oct 13, 1998
|Ibm Corporation
|Cache coherence protocol for reducing the effects of false sharing in non-bus-based shared-memory multiprocessors
|Jul 11, 1997
|Sep 12, 2000
|Phone.Com, Inc.
|Pushing and pulling data in networks
|Aug 17, 2001
|May 23, 2002
|Serge Lasserre
|Cache with block prefetch and DMA
|Aug 17, 2001
|May 30, 2002
|Gerard Chauvel
|Cache/smartcache with interruptible block prefetch
|Aug 17, 2001
|Jun 6, 2002
|Gerard Chauvel
|Cache with DMA and dirty bits
|Aug 17, 2001
|Jun 6, 2002
|Gerard Chauvel
|Cache and DMA with a global valid bit
|Aug 17, 2001
|Jun 20, 2002
|Serge Lasserre
|Local memory with indicator bits to support concurrent DMA and CPU access
|Jul 22, 1999
|Jan 27, 2000
|Intel Corp
|Computer system for conducting cache-segment flush invalidation operations
|Title not available
|Texas Instruments Incorporated, S/N: 09/187,118, filed Nov. 15, 1998, Computer Circuits, Systems, and Methods Using Partial Cache Cleaning.
|Citing Patent
|Filing date
|Publication date
|May 20, 2004
|Aug 7, 2007
|S. Aqua Semiconductor Llc
|Pipelined semiconductor memories and systems
|Feb 17, 2005
|May 27, 2008
|Texas Instruments Incorporated
|Organization of dirty bits for a write-back cache
|Nov 2, 2004
|Jul 19, 2011
|Panasonic Corporation
|Cache memory and method for cache entry replacement based on modified access order
|Jul 30, 2003
|Feb 5, 2004
|Zohar Bogin
|Method and apparatus for write cache flush and fill mechanisms
|May 20, 2004
|Dec 2, 2004
|Silicon Aquarius Incorporated
|Pipelined semiconductor memories and systems
|Feb 17, 2005
|Aug 17, 2006
|Texas Instruments Incorporated
|Organization of dirty bits for a write-back cache
|Jun 29, 2007
|Jan 10, 2008
|Rao G R Mohan
|Pipelined semiconductor memories and systems
|Nov 2, 2004
|Jul 10, 2008
|Hazuki Okabayashi
|Cache Memory and Control Method Thereof
|Jul 21, 2011
|Panasonic Corporation
|Cache memory and method for cache entry replacement based on modified access order
|Jul 31, 2012
|Jan 21, 2015
|Application sensation-based cache control method and device for microprocessor terminal
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Jan 2, 2002
Owner name: TEXAS INSTRUMENTS INCORPORATED, TEXAS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TI-FU;TI-US;CHAUVEL, GERARD;AND OTHERS;REEL/FRAME:012442/0115;SIGNING DATES FROM 20010827 TO 20011009
|Sep 14, 2007
|Fee payment
Year of fee payment: 4
|Sep 23, 2011
|Fee payment
Year of fee payment: 8
|Sep 24, 2015
|Fee payment
Year of fee payment: 12


text:
--Jim Kouzes, Chairman and CEO, TPG (Tom Peters Group) Learning Systems, and co-author of The Leadership Challenge
"First to map the uncharted new world of interactive business. Use it to unlock the immense potential value of your customers."
--Scott Cook, President, Intuit
"Everyone should read this practical, insightful book. There would not only be many more profitable businesses of all sizes, there would also be a lot more satisfied, loyal customers."
--Esther Dyson, President, EDventure Holdings
"Exceptional. We're basing our strategic planning on these principles."
--Larry Rosenberger, President and CEO, Fair, Isaac
"Look no further than Enterprise One to One to find a practical business model for operating in an online interactive world."
--Martin Nisenholtz, President, The New York Times Electronic Media Company
"Creative, insightful, compelling."
--Wolfgang R. Schmitt, Chairman of the Board and CEO, Rubbermaid Incorporated


text:
Crystal Hutchinson, Department Head
|Renee´ Pike, Assistant, Cataloger
Ext. 133
|Margie Sheppard, Aide
Ext: 132
|Missy Esfeld, Bookkeeper
Ext: 132
The Technical Services Department orders, catalogs, and processes library materials for member libraries, as well as providing MARC records. We supply physical and bibliographical preparation of books so they are ready "shelf ready". We secure the best possible discounts from jobbers through volume buying and provide processing supplies to member libraries at quantity discount prices.
CKLS orders enough popular titles from Ingram to receive a 40% discount on most items. We can order from other sources as well, but discounts may not be as liberal.
Librarians wishing to purchase items themselves and wanting CKLS cataloging and processing can have items "dropped shipped" to us. This means the shipping address should say [Your library name] c/o Central Kansas Library System, 1409 Willams Street, Great Bend, KS. Billing address should specify your library.
CKLS member libraries are encouraged to provide access to their collections through standard cataloging (MARC standards) and quality bibliographic information. Member librarians are expected to enter new records and remove obsolete records from the statewide bibliographic database through either the CKLS Technical Services Department or another method approved by the State Library.
All CKLS cataloging provides MARC records to the library and places the cataloging record on the state's Kansas Library Catalog. Librarians wishing only cataloging for items should fill out "pink slips" for that item and mail them to Technical Services. If you need more "pink slips" contact our Department.
We also do original cataloging for all items that do not have MARC records from other sources.
Disc Cleaning
Current Supplies (2015)
Book Pockets
$1.80 per 100; $9.00 per box of 500
Date Due Slips
Small (3x3): $1.35 per 100
Small (3x3): $6.74 per 500
Large (3x5): $1.35 per 100
Large (3x5): $6.74 per 500
|Check-out cards
Ruled: $2.02 per 100; $20.02 per 1000
Book jacket covers
#8: $15.37 per 100
#9: $17.63 per 100
#10: $19.37 per 100
#12: $23.24 per 100
#14: $30.26 per 100
#16: $37.70 per 100
|Paperback plastic laminate x 420"
8 in: $23.16 per roll
9 in: $25.56 per roll
10 in: $27.16 per roll
12 in: $33.95 per roll
14 in: $38.20 per roll
18 in: $46.95 per roll
Book tape (clear)
1.5 in x 15 yds.: $3.52 per roll
2 in x 15 yds.: $4.97 per roll
3 in x 15 yds.: $6.64 per roll


text:
GOLDEN – Colorado School of Mines softball staved off a comeback bid by Southwest Minnesota State and earned its first win of the season Saturday, defeating the visiting Mustangs 8-6 in the 2014 home-opener at CSM Softball Field.
Mines (1-5) rallied from a 3-0 hole with five runs in its opening at-bat on a one-out RBI single to center from senior Sami Springer and a pair of two-run doubles by junior Cassie Ford and senior Melissa Marshall.
Sophomore starter Kristen Prudhomme (1-4) then settled in, retiring 10 of the next 15 batters with only two hits allowed between the second and fifth innings.
The Orediggers added insurance scores in the fifth, extending the lead to 8-3 as senior Courtney Derus tripled in Ford and Springer, and Marshall followed with a sharp base hit down the rightfield line.
SMSU (0-1) cut the lead to 8-6 in its half of the sixth and was threatening with bases loaded, before senior Gianna Duncan snared a line drive at third base on a 1-2 count to quiet the rally.
The Mustangs sent the tying run to the plate with one out in the seventh on a walk and single to left. However, freshman rightfielder Kara Walling gloved a tailing fly ball off the bat of Bailie Sheahan and threw out the tagging runner at third, completing the Orediggers' fourth double play and securing head coach Leah Glasgow's initial win at the helm.
Batting third through sixth, Springer, Ford, Derus and Marshall combined to go 7-for-11 with seven RBI and six runs scored.
Springer batted 2-for-4 with two runs; Ford was 2-for-3 with the two RBI and two runs, and Marshall closed 2-for-2 with three RBI and a walk. Derus finished 1-for-2 with two RBI, two runs and one walk.
Prudhomme totaled 129 pitches in 6.1 innings of work with four earned runs allowed on nine hits and three strikeouts to earn her first collegiate win in the circle.


text:
Sign in now to view, license and download this image or contact us to see this image without a watermark. Want to embed this image on a non-commercial website or blog? Learn more.
Similar imagesView all
Maori Skull Stock Photo1974,Adult,Adults Only,Art And Craft,Black And White,Close-up,England,Europe,Horizontal,Human Body Part,Human Face,Human Skull,Image,Māori,Occupation,One Person,One Woman Only,Photography,Scientist,Tattoo,UK,WatchingPhotographer Frank BarrattCollection: Hulton Archive A Maori skull, dating from the mid to late 19th century. The skull has tattoo decorations all over the face; the eye sockets have been inlaid with pieces of shell and the ears have been removed.


text:
Church Apparel
Pilgrim Clergy Robe H-3 Black
Murphy Robes$239.90
Need help ordering? Ask a question and we'll get back to you. Or call 1-888-319-0319
Murphy Robes
"to look after orphans and widows in their distress..." James 1:27 NIV
Our heartbeat is to help orphans and widows in need, as our Father calls us to do.
And with every purchase you make, you're making an amazing difference in their lives.


text:
"Masbate, the Philippines" Province of Masbate by dangerlee
Province of Masbate Travel Guide: 41 reviews and 234 photos
I first visited Masbate province in 2002 looking for hidden beautiful beaches and came across immaculately crystal-clear beaches. When I flied to Masbate again in 5 years, they were still surprizingly well-preserved.
Reviews (1)
Junner's and Avila's resorts are managed by Mr.Stacey, the current government employee of Esperanza. It's located... more travel advice
Have you been to Province of Masbate? Share your travels with the world!
Comments (1)
Avila's Island was not just named after the former Mayor of Pio V Corpus, he owned it as well. Mr Pio Avila, his wife and children remains were nestled on the island as well.
Province of Masbate Travel Guide
Member Travel Pages
- "Masbate, the Philippines"
- "Province of Masbate"
- See All...
- Things to Do in Province of Masbate
- Hotels in Province of Masbate
- Transportation in Province of Masbate
- Restaurants in Province of Masbate
- Warnings and Dangers in Province of Masbate
- See All...
Badges & Stats in Province of Masbate
- 1 Reviews
- 6 Photos
- 0 Forum posts
- 1,071PageViews
- 0 Cities
- See All Stats
- See All Badges (1)
Have you been to Province of Masbate?Share Your Travels
Latest Activity in Province of Masbate
- updated a Province of Masbate Travel Page "Masbate, the Philippines"
- Uploaded a Photo to "Masbate, the Philippines"
- Wrote a Review For the travellers of southern... in Province of Masbate Hotels
Photos in Province of MasbateSee All Photos (6)
No friends yet.


text:
Frank Palumbo's Articles
The Platform
Reinventing the Data Center for a Digital World: Cisco HyperFlex Systems
Successful innovators can sneak up on you. Apple's iPhone actually followed a string of other smart phones from competitors likeRead More
The Platform
Cisco and VCE Continue to Lead the Industry
A few weeks ago, EMC took the opportunity during their earnings to reaffirm their commitment to VCE and demonstrate theRead More
The Platform
Data Centers: Applications, Networks and Chicken-Salad Sandwiches
You've seen the data points: 30 million new devices connected to the Internet each week. A whopping 50 billion connectedRead More
The Platform
How a Traffic Jam in Hong Kong Gave Me Hope
A couple weeks ago, I had the opportunity to travel to China and South Korea to meet with Cisco customersRead More
The Platform
Balancing Innovation and Evolution: Cutting Through the Noise
Thinking back to how much the data center has transformed in the past ten, five, or even two years isRead More
The Platform
Future-Proofing the Data Center in a World of Accelerated Change
One thing that I frequently hear when speaking with our data center customers is how the application landscape is inRead More


text:
- Ready to train?
- Currently Unavailable
with Elmar Bolowich, University of North Carolina Head Coach
Coach Bolowich and his assistants present this excellent training session in three phases; phase one is attacking the goal and getting behind the defender for a shot, phase two is the 7 v 5 situation and the third phase is an 11 v 10 situation, including: quality of shots, crosses from the flanks, timed runs into the box and combination play.
One-on-one play is key to this training session. The 7 v 5 session looks for quality crosses, passes and hitting the key target areas. Attacks from the center of the field with combination play are also a focus. Offensive keys to the 7 v 5 session are: two attackers up front, hit the target post positions, timing, and quality shots on goal. Defensively - the counter attack, playing out the ball, initiating the attack and visible offside line are important. Benefits of the 7 v 5 training are to create combination plays, serving the ball to targets, practicing quality shots on goal and gaining total field awareness. The 11 v 10 situation focuses on decision-making, being aware of the entire field before passing, and finding the open post in the box before giving up the ball and switching the ball to the opposite side of the field when zones are overloaded are important to solid play in 11 vs. 10.
72 minutes. 2007.
Lamentamos que todavia no hay descripción en español para este producto.