Rackspace supports and manages the world’s leading cloud platforms by listening to customers as they explore how technology can better serve their business. Cloud services are designed to fit the customer’s unique IT needs while protecting their cloud environments.
With cloud services in mind, the Rackspace Booster Pack contains cards that highlight various considerations for detecting and ejecting threats to help minimize damage to an organization’s network. Unique to this deck is the rare “Rackspace Managed Services” defense card and uncommon cards such as “Secure Coding Practices” and “Stack Overflow”.
A program attempted to use more memory than it had available, and has crashed during a critical operation.
Select an opponent. That opponent must discard the top 2 cards from their draw pile. Discard this card from play afterward.
A search engine is a powerful information retrieval tool that crawls through and indexes large sets of complex data. Once the data is indexed, it is possible to search for specific information quickly.
While this card is in play, at the beginning of your turn, you may draw two cards from your deck. If you do so, immediately place one of these two cards into your hand, and put the other at the bottom of your deck.
You establish a contract with specialist from Rackspace Managed Services (RMS) which helps to automate security processes, quickly detecting and ejecting threats to help minimize damage.
While this card is in play, all Attack cards that target you expire in one round instead of their usual timeframe. Remove this card from play after 3 rounds.
Your opponent was attacked by the CryptoLocker ransomware, which maliciously encrypted files on their devices to make them unusable. The ransomware is demanding payment in exchange for decrypting the files.
Target opponent cannot earn any points from Asset – Data cards, and loses 1 point at the end of each round that this is in play. The affected player may discard 3 cards to remove CryptoLocker from play.
A binary search is an algorithm designed to quickly search a sorted data structure by recursively splitting sets of data in half and comparing their values.
Cut your deck into two piles. Draw one card from the top of each pile, then shuffle your deck. If the values of the two cards match, put both into your hand. Otherwise, put the card with the higher value in your hand, and the card with the lower value at the bottom of your deck.